𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Factors of Multivariate Polynomials

✍ Scribed by Peter Bürgisser

Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
316 KB
Volume
4
Category
Article
ISSN
1615-3375

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factorization of Multivariate Polynomial
Factorization of Multivariate Polynomials with Coefficients in Fp
✍ Guy Viry 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 548 KB

The ring of polynomials in \(X, X_{1}, \ldots, X_{m}\) are denoted by \(\mathbf{F}_{p}\left[X, X_{1}, \ldots, X_{m}\right]\) in \(F_{p}\), that is the field of integers defined modulo \(p\). In the usual factorization algorithm defined by Wang, the given polynomial \(P\) is first factorized modulo \

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

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

Test complexity of generic polynomials
Test complexity of generic polynomials
✍ Peter Bürgisser; Thomas Lickteig; Michael Shub 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 595 KB