Efficient Algorithms for Zeckendorf Arithmetic
Data Structures and Algorithms
2012-07-20 v1 Combinatorics
Abstract
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size and logarithmic depth. The implications of these results for multiplication, division and square-root extraction are also discussed.
Cite
@article{arxiv.1207.4497,
title = {Efficient Algorithms for Zeckendorf Arithmetic},
author = {Connor Ahlbach and Jeremy Usatine and Nicholas Pippenger},
journal= {arXiv preprint arXiv:1207.4497},
year = {2012}
}
Comments
i+6 pp