𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the deterministic complexity of searching local maxima

✍ Scribed by Ingo Althöfer; Klaus-Uwe Koschnick

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
160 KB
Volume
43
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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