✦ LIBER ✦

On the oracle complexity of factoring integers

✍ Scribed by Ueli M. Maurer

Book ID: 105117689
Publisher: Springer
Year: 1995
Tongue: English
Weight: 645 KB
Volume: 5
Category: Article
ISSN: 1016-3328
DOI: 10.1007/bf01206320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the elliptic curvey2=x3−2rDxand facto

On the elliptic curvey2=x3−2rDxand factoring integers

✍ Li, XiuMei; Zeng, JinXiang 📂 Article 📅 2014 🏛 SP Science China Press 🌐 English ⚖ 212 KB

On the Deterministic Complexity of Facto

On the Deterministic Complexity of Factoring Polynomials

✍ Shuhong Gao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting

On the maximum and minimum exponents in

On the maximum and minimum exponents in factoring integers

✍ D. Suryanarayana; R. Sita Rama Chandra Rao 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 331 KB

On the deterministic complexity of facto

On the deterministic complexity of factoring polynomials over finite fields

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Computational complexity of linear const

Computational complexity of linear constraints over the integers

✍ Jonsson, Peter; Lööw, Tomas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A note on the density of oracle decreasi

A note on the density of oracle decreasing time–space complexity

✍ Pavol Ďuriš; JoséD.P. Rolim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 717 KB