Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields

DOI10.1007/978-3-662-43948-7_60zbMath1373.11079arXiv1504.00572MaRDI QIDQ5167786

Mrinal Kumar, Swastik Kopparty, Michael E. Saks

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00572

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68R15: Combinatorics on words

94A60: Cryptography

11T06: Polynomials over finite fields