9 citations · 37 across the 32 of their papers we have counts for
Showing 2013 · cs.PLShow all
2 papers · 2 filters
cs.PL2013★ 2 cited
A Prolog Specification of Giant Number Arithmetic
Paul Tarau
The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the…
cs.PL2013
Tree-based Arithmetic and Compressed Representations of Giant Numbers
Paul Tarau
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers whil…