On Faster Integer Calculations using Non-Arithmetic Primitives

Details On Faster Integer Calculations using Non-Arithmetic Primitives On Faster Integer Calculations using Non-Arithmetic Primitives

2007-09-05

arxiv.org/abs/0709.0624v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Faster Integer Calculations using Non-Arithmetic Primitives does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Faster Integer Calculations using Non-Arithmetic Primitives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Faster Integer Calculations using Non-Arithmetic Primitives will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-470318