期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2020
卷号：2020
页码：1-27
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：For every constant c > 0, we show that there is a family {PN,c} of polynomials whose degree and algebraic circuit complexity are polynomially bounded in the number of variables, that satisfies the following properties: • For every family { fn} of polynomials in VP, where fn is an n variate polynomial of degree at most n c with bounded integer coefficients and for N = ( n c n n ), PN,c vanishes on the coefficient vector of fn. • There exists a family {hn} of polynomials where hn is an n variate polynomial of degree at most n c with bounded integer coefficients such that for N = ( n c n n ), PN,c does not vanish on the coefficient vector of hn. In other words, there are efficiently computable defining equations for polynomials in VP that have small integer coefficients. In fact, we also prove an analogous statement for the seemingly larger class VNP. Thus, in this setting of polynomials with small integer coefficients, this provides evidence against a natural proof like barrier for proving algebraic circuit lower bounds, a framework for which was proposed in the works of Forbes, Shpilka and Volk [FSV18], and Grochow, Kumar, Saks and Saraf [GKSS17]. Our proofs are elementary and rely on the existence of (non-explicit) hitting sets for VP (and VNP) to show that there are efficiently constructible, low degree defining equations for these classes and also extend to finite fields of small size.
