✦ LIBER ✦

Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing

✍ Scribed by Qi Cheng; Sergey P. Tarasov; Mikhail N. Vyalyi

Book ID: 105915056
Publisher: Springer
Year: 2008
Tongue: English
Weight: 538 KB
Volume: 46
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9158-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Quantum Algorithms for Simulat

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

✍ Dominic W. Berry; Graeme Ahokas; Richard Cleve; Barry C. Sanders 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 191 KB

Zero-one integer programs with few const

Zero-one integer programs with few constraints —Efficient branch and bound algorithms

✍ Bezalel Gavish; Hasan Pirkul 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Efficient Algorithms for Shortest Paths

Efficient Algorithms for Shortest Paths in Sparse Networks

✍ Johnson, Donald B. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 833 KB

An efficient algorithm for parallel inte

An efficient algorithm for parallel integer multiplication

✍ Benjamin Singer; George Saon 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t

Efficient integer algorithms for the gen

Efficient integer algorithms for the generation of conic sections

✍ A. Agathos; T. Theoharis; A. Boehm 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Efficient order selection algorithms for

Efficient order selection algorithms for integer-valued ARMA processes

✍ Víctor Enciso-Mora; Peter Neal; T. Subba Rao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB