Efficient Algorithms for Zeckendorf Arithmetic
From MaRDI portal
Publication:2868803
zbMath1350.11016arXiv1207.4497MaRDI QIDQ2868803
Connor Ahlbach, Jeremy Usatine, Nicholas J. Pippenger, Christiane Frougny
Publication date: 19 December 2013
Full work available at URL: https://arxiv.org/abs/1207.4497
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other number representations (11A67)
Related Items (4)
Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ A Fibonacci analogue of the two’s complement numeration system ⋮ Ostrowski numeration systems, addition, and finite automata ⋮ On the complexity of Fibonacci coding
This page was built for publication: Efficient Algorithms for Zeckendorf Arithmetic
