A carregar...
Publicação
Permutation reconstruction from a few large patterns
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 346.32 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Every permutation of rank n ≥ 5 is reconstructible from any ⌈n/2⌉ + 2 of its (n − 1)-patterns.
Descrição
Palavras-chave
Theoretical Computer Science Geometry and Topology Discrete Mathematics and Combinatorics Computational Theory and Mathematics Applied Mathematics