On Faster Integer Calculations using Non-Arithmetic Primitives

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Data Structures and Algorithms, F.1.1; F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/137370

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.0624
 http://arxiv.org/abs/0709.0624

Collections

arXiv