Ranking binary unlabelled necklaces in polynomial time
From MaRDI portal
Publication:2112175
DOI10.1007/978-3-031-13257-5_2OpenAlexW4298400215MaRDI QIDQ2112175
Publication date: 18 January 2023
Full work available at URL: https://arxiv.org/abs/2205.13916
Related Items (3)
Ranking and unranking bordered and unbordered words ⋮ Ranking and Unranking k-Subsequence Universal Words ⋮ The k-centre problem for classes of cyclic words
Cites Work
- Unnamed Item
- Unnamed Item
- Unranking of small combinations from large sets
- Unavoidable sets and circular splicing languages
- Symmetry types of periodic sequences
- Ranking and unranking permutations in linear time
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Linear-Time Ranking of Permutations
- Ranking Algorithms for Lists of Partitions
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
- The complexity of splitting necklaces and bisecting ham sandwiches
- On the Hardness of Energy Minimisation for Crystal Structure Prediction*
- Ranking Bracelets in Polynomial Time.
This page was built for publication: Ranking binary unlabelled necklaces in polynomial time
