scientific article
From MaRDI portal
Publication:2816411
DOI10.4086/toc.2016.v012a007zbMath1373.11080OpenAlexW2201499386MaRDI QIDQ2816411
Mrinal Kumar, Swastik Kopparty, Michael E. Saks
Publication date: 22 August 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2016.v012a007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorics on words (68R15) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items (4)
Finding the largest fixed-density necklace and Lyndon word ⋮ The k-centre problem for classes of cyclic words ⋮ Ranking and unranking fixed-density necklaces and Lyndon words ⋮ Ranking binary unlabelled necklaces in polynomial time
Cites Work
This page was built for publication:
