On the algorithmic complexity of some numeration-related problems
From MaRDI portal
Publication:5859586
DOI10.5486/PMD.2021.8758zbMath1488.11018OpenAlexW3127834556MaRDI QIDQ5859586
Dávid Bóka, Péter Burcsi, János M. Uray
Publication date: 16 April 2021
Published in: Publicationes Mathematicae Debrecen (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5486/pmd.2021.8758
Symbolic computation and algebraic computation (68W30) Radix representation; digital problems (11A63) Randomized algorithms (68W20) Matrices, determinants in number theory (11C20)
This page was built for publication: On the algorithmic complexity of some numeration-related problems