✦ LIBER ✦

Polynomial time algorithms for sentences over number fields

✍ Scribed by Shih Ping Tung

Book ID: 113384013
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 979 KB
Volume: 97
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(92)90037-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for sentences over integral d

Algorithms for sentences over integral domains

✍ Shih Ping Tung 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A polynomial-time algorithm for global v

A polynomial-time algorithm for global value numbering

✍ Sumit Gulwani; George C. Necula 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 953 KB

Permutation polynomials over algebraic n

Permutation polynomials over algebraic number fields

✍ R Matthews 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Fast Parallel Algorithms for Sparse Mult

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

✍ Grigoriev, Dima Yu.; Karpinski, Marek; Singer, Michael F. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 709 KB

Quantum algorithms for number fields

✍ D. Haase; H. Maier 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB

## Abstract This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still

Factoring Multivariate Polynomials over

Factoring Multivariate Polynomials over Algebraic Number Fields

✍ Lenstra, Arjen K. 📂 Article 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 892 KB