On Faster Integer Calculations using Non-Arithmetic Primitives

Simple item page
dc.creatorLürwer-Brüggemeier, Katharina
dc.creatorZiegler, Martin
dc.date2007-09-05
dc.date.accessioned2026-07-07T08:27:44Z
dc.date.available2026-07-07T08:27:44Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0709.0624
dc.identifierhttp://arxiv.org/abs/0709.0624
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137370
dc.subjectData Structures and Algorithms
dc.subjectF.1.1; F.2.2
dc.titleOn Faster Integer Calculations using Non-Arithmetic Primitives
dc.typetext

Files

Collections

arXiv