Pages that link to "Item:Q5167786"
From MaRDI portal
The following pages link to Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (Q5167786):
Displaying 4 items.
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442) (← links)
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516) (← links)