Permutation reconstruction from a few large patterns
Every permutation of rank n ≥ 5 is reconstructible from any ⌈n/2⌉ + 2 of its (n − 1)-patterns.
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/131754 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/131754 |