On Faster Integer Calculations using Non-Arithmetic Primitives
Data Structures and Algorithms
2007-09-06 v1
Abstract
The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware, may lead to a considerable drop in complexity. We show a variety of concrete problems to benefit from such NON-arithmetic primitives by presenting and analyzing corresponding fast algorithms.
Cite
@article{arxiv.0709.0624,
title = {On Faster Integer Calculations using Non-Arithmetic Primitives},
author = {Katharina Lürwer-Brüggemeier and Martin Ziegler},
journal= {arXiv preprint arXiv:0709.0624},
year = {2007}
}