𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Test complexity of generic polynomials

✍ Scribed by Peter Bürgisser; Thomas Lickteig; Michael Shub

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
595 KB
Volume
8
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The parametrized complexity of knot poly
The parametrized complexity of knot polynomials
✍ J.A. Makowsky; J.P. Mariño 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We study the parametrized complexity of the knot (and link) polynomials known as Jones polynomials, Kauffman polynomials and HOMFLY polynomials. It is known that computing these polynomials is xP hard in general. We look for parameters of the combinatorial presentation of knots and links which make

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

Galois Groups of Generalized Iterates of
Galois Groups of Generalized Iterates of Generic Vectorial Polynomials
✍ Shreeram S. Abhyankar; Ganapathy S. Sundaram 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Let q"pS'1 be a power of a prime p, and let k O be an over"eld of GF(q). Let m'0 be an integer, let J\* be a subset of +1, 2 , m,, and let E\* KO (>)"> qK # HZ( \* X H >O K\H where the X H are indeterminates. Let J ? be the set of all m! where is either 0 or a divisor of m di!erent from m. Let s(¹)"