𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Parallel Complexity of the Polynomial Ideal Membership Problem

✍ Scribed by Peter Bürgisser

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
457 KB
Volume
14
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the pancake problem
On the complexity of the pancake problem
✍ Fuxiang Yu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract We study the computational complexity of finding a line that bisects simultaneously two sets in the two‐dimensional plane, called __the pancake problem__, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main resul

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