arXiv
Open Access
2015
Rule based lexicographical permutation sequences
Asbjørn Brændeland
Abstrak
In a permutation sequence built by means of sub permutations the transition between successive permutations are subject to a set of n(n - 1)/2 rules that group into n - 1 matrices with a high degree of regularity. By means of these rules the sequence can be produced in O(3n!) time and O(n^3) space.
Topik & Kata Kunci
Penulis (1)
A
Asbjørn Brændeland
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2015
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓