Title :
Tseitin´s tautologies and lower bounds for Nullstellensatz proofs
Author_Institution :
Dept. of Math. & Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
Abstract :
We use the known linear lower bound for Tseitin´s tautologies for establishing linear lower bounds on the degree of Nullstellensatz proofs (in the usual boolean setting) for explicitly constructed systems of polynomials of a constant (in our construction 6) degree. It holds over any field of characteristic distinct from 2. Previously, a linear lower bound was proved for an explicitly constructed system of polynomials of a logarithmic degree
Keywords :
Boolean functions; polynomials; theorem proving; Nullstellensatz proofs; Tseitin´s tautologies; boolean setting; explicitly constructed systems; logarithmic degree; lower bounds; polynomials; Calculus; Computer science; Design methodology; Mathematics; Polynomials; Upper bound;
Conference_Titel :
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
0-8186-9172-7
DOI :
10.1109/SFCS.1998.743515