On Faster Integer Calculations Using Non-arithmetic Primitives
From MaRDI portal
Publication:3543338
DOI10.1007/978-3-540-85194-3_11zbMath1166.68322arXiv0709.0624OpenAlexW1882149055MaRDI QIDQ3543338
Katharina Lürwer-Brüggemeier, Martin Ziegler
Publication date: 2 December 2008
Published in: Unconventional Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.0624
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\) ⋮ P-RAM vs. RP-RAM ⋮ Arbitrary sequence RAMs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for sorting integers on random access machines
- Matrix multiplication via arithmetic progressions
- Factoring numbers in O(log n) arithmetic steps
- Valiant's model and the cost of computing integers
- On a class of \(O(n^ 2)\) problems in computational geometry
- Fast exponentiation using the truncation operation
- On the Complexity of Numerical Analysis
- On computations with integer division
- A sublinear additive sieve for finding prime number
- The large sieve
- My Numbers, My Friends
- Deterministic sorting in O(nloglogn) time and linear space
- An Efficient Formula for Linear Recurrences
- Algorithms and Data Structures
- Determining Mills' Constant and a Note on Honaker's Problem
This page was built for publication: On Faster Integer Calculations Using Non-arithmetic Primitives