Integer Complexity: Experimental and Analytical Results II
From MaRDI portal
Publication:5500681
DOI10.1007/978-3-319-19225-3_5zbMath1432.68175arXiv1409.0446OpenAlexW2964035821MaRDI QIDQ5500681
Karlis Podnieks, Mārtiņš Opmanis, Jānis Iraids, Juris Čerņenoks, Rihards Opmanis
Publication date: 7 August 2015
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.0446
Analysis of algorithms and problem complexity (68Q25) Radix representation; digital problems (11A63)
Related Items
Integer complexity and well-ordering, On algorithms to calculate integer complexity, Integer complexity: algorithms and computational results, Integer Complexity: Experimental and Analytical Results II
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Walking on real numbers
- Integer complexity and well-ordering
- Counting arithmetic formulas
- Maximal Independent Sets and Separating Covers
- On the representation of an integer in two different bases.
- Automatic Sequences
- Numbers with Integer Complexity Close to the Lower Bound
- Integer Complexity: Experimental and Analytical Results II
- Champernowne’s Number, Strong Normality, and the X Chromosome