Answers are grounded in this paper and cite their sources.
We show that converting an n-digit number from a binary to Fibonacci representation and backward can be realized by Boolean circuits of complexity O(M(n) log n), where M(n) is the complexity of integer multiplication. For a more general case of r-Fibonacci representations, the obtained complexity estimates are of the form 2O(√log n )ₙ .
No takes yet. Share an insight, caveat, or question.
I. S. Sergeev (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: