Pages that link to "Item:Q2816411"
From MaRDI portal
The following pages link to Efficient indexing of necklaces and irreducible polynomials over finite fields (Q2816411):
Displaying 4 items.
- Ranking binary unlabelled necklaces in polynomial time (Q2112175) (← links)
- Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399) (← links)
- Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516) (← links)