DeepAI AI Chat
Log In Sign Up

The Complexity of Factors of Multivariate Polynomials

by   Peter Bürgisser, et al.

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such families of polynomial functions of polynomially bounded degree over fields of characteristic zero. The proof relies on a polynomial upper bound on the approximative complexity of a factor g of a polynomial f in terms of the (approximative) complexity of f and the degree of the factor g. This extends a result by Kaltofen (STOC 1986). The concept of approximative complexity allows to cope with the case that a factor has an exponential multiplicity, by using a perturbation argument. Our result extends to randomized (two-sided error) decision complexity.


page 1

page 2

page 3

page 4


Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs

The complexity of graph homomorphisms has been a subject of intense stud...

Tropicalization, symmetric polynomials, and complexity

D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials...

A full complexity dichotomy for immanant families

Given an integer n≥ 1 and an irreducible character χ_λ of S_n for some p...

Formal Power Series on Algebraic Cryptanalysis

In cryptography, attacks that utilize a Gröbner basis have broken severa...

Low-degree learning and the metric entropy of polynomials

Let ℱ_n,d be the class of all functions f:{-1,1}^n→[-1,1] on the n-dimen...

A Tight Analysis of Bethe Approximation for Permanent

We prove that the permanent of nonnegative matrices can be deterministic...