P. Beame, R. Impagliazzo, J. Krajicek, T. Pitassi, and P. Pudlak. Lower bounds on hilbert's nullstellensatz and propositional proofs. In Proceedings of the 35th Annual Symposium on Foundations Of Computer Science, pages 794--806. IEEE, November 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....equations has lead to considering algebraic proof systems, in particular, the Nullstellensatz (NS) and the Polynomial Calculus (PC) proof systems, see Subsection 2. 2 below (we do not dwell much here on the history of this rich area, several nice historical overviews one could nd in e.g. [4 9]) For these proof systems several interesting complexity lower bounds on the degrees of the derived polynomials were obtained [6, 7, 9] When the degree is close enough to linear (in fact, greater than the square root) these bounds imply exponential lower bounds on the proof complexity (more ....

....: 1 v n ) denotes a polynomial with exponentially many monomials) Note that F is a tautology if and only if the obtained system S of polynomial equations f 1 = 0, f 2 = 0, fm = 0 has no solutions. Therefore, to prove F it suces to derive a contradiction from S. Nullstellensatz (NS) [4]. A proof in this system is a collection of polynomials g 1 ; gm such that f i g i = 1: Polynomial Calculus (PC) 8] This system has two derivation rules: p 1 = 0; p 2 = 0 p 1 p 2 = 0 and p = 0 p q = 0 : 2) i.e. one can take a sum of two already derived equations p 1 = ....

Beame, P., Impagliazzo, R., Krajcek, J., Pitassi, T., Pudlak, P.: Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc. 73 (1996) 1-26

....the completeness of the polynomial calculus with respect to CNF formulas. Theorem 5.6 A CNF C is unsatis able i there is a polynomial calculus proof of P(C) in the Boolean ring over F. The rst algebraic avor proof system, called the Nullstellensatz system, was introduced and analyzed by [Beame et al. 94)] The polynomial calculus is a simpli cation and strengthening of this system, and was introduced by [Clegg, et al. 96) who presented it as a candidate for an automatizable proof system, and also proved an exponential separation between it and its weaker predecessor the Nullstellensatz ....

S. Beame, R. Impagliazzo, J. Krajcek. , T. Pitassi, and P. Pudlak. Lower Bounds on Hilbert's Nullstellensatz and propositional proofs. In Proceedings of the 35th IEEE FOCS, pp 794-806, 1994. Journal version to appear in Proceedings of the London Math. Soc..

.... m; k 2 Ng. 2 Corollary 1: Let r(n) be as above. For each q; p 2 Count(p) 6 PHP r( bij) if and only if p divides a power of q. Corollary 2: For fixed q; p 2 the following is equivalent (a) p divides a power of q (b) Count(q) Count(p) Proof: The implication (a) b) was shown in [4] or [9] The implication (b) a) follows from the Theorem. According to the Theorem Count(p) 6 PHP r( bij) if Count(q) Count(p) But then by the easy only if in corollary 1, p must divide a power of q. 2 Let PHP p (inj) be the the statement that there is no n and no injective map ....

P.Beame, R. Impagliazzo, J. Krajicek, T. Pitassi, P. Pudlak; Lower bounds on Hilbert's Nullstellensatz and propositional proofs, preliminary version.

....systems have the advantage of being automatizable in that the time taken to nd the proof is strongly related to the length of the proof. More recently, algebraic deductive systems have been employed in the context of proving lower bounds on the proof complexity of propositional tautologies [4], 5] 7] 8] Showing the nonexistence of polynomial (in n) length proofs for a sequence of tautologies n , is directly linked to the NP 6= co NP question: the link becomes stronger with the strength of the proof system used. In this paper, we rst give a systematic method of translating an ....

....number theory, graph theory, or combinatorics can be phrased in this manner. Our translation highlights the fact that many tautologies used for showing algebraic proof complexity lower bounds, such as various matching principles, versions of the pigeonhole principle, and primality principle [4], 5] 7] 11] can indeed be obtained from natural Second Order Existential statements. We illustrate this using examples. More signi cantly, we introduce a method to systematically generate hard propositional tautologies from Second Order Existential sentences. The method relies on sentences ....

[Article contains additional citation context not shown here]

Beame, P., Impagliazzo, R., Krajicek, J., Pitassi, T., Pudlak, P.: Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society 73(3) 1-26 (1996)

....of the fact that a ZFC proof of size n does not exist for an input conjecture. One class of proof systems that are studied in this context are the so called algebraic proof systems. Such systems have been studied intensively within recent years. The systems we will consider was rst introduced in [4]. These systems arise from the following observation. All NP decision problems can be phrased as deciding the existence of 0=1 solutions to systems of (multilinear) polynomial equations. As in the examples given earlier, if the decision problems are parametrized by n, then the resulting polynomial ....

....parametrized by n. We can think of Q n as, for example, the nite system of polynomial equations corresponding to the question about the existence of groups of size n with some algebraic property. If we include the polynomials x x in Q n (one for each variable x) we see (as also observed in [4]) that 1 2 ( Q) n if and only if there is no group of size n possessing a speci c algebraic property. This suggests (and this was indeed suggested in [4] that we consider elementary, algebraic proof systems designed for proving ideal membership. As mentioned earlier, an elementary proof ....

[Article contains additional citation context not shown here]

Beame, P., Impagliazzo, R., Krajicek, J., Pitassi, T., Pudlak, P.: Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society 73(3) 1-26 (1996) 34

....dag resolution. Later this result was improved considerably by Ajtai [1] 2] to a super polynomial lower bound on bounded depth Frege proofs. Ajtai also used his approach to show independence results from Bounded Arithmetic. These results were later improved in various ways and generalities [3] [5], 8] 25] 26] Informally we can state our result as follows: Let # n denote a sequence of tautologies which expresses the validity of a fixed combinatorial principle com . n denote the negation of # n on Conjunctive Normal Form. Our main result states that for any such sequence n ....

....proof systems (or equivalently to characterise the theory T P ) Consider for example the NS proof system (over fields of characteristic 0) This is a very interesting propositional proof system which has been studied intensively in the recent years. The system was first introduced in [5] and has many nice features [12] We finish the paper by showing that the Nullstellensatz proof system proves the following version of the pigeon hole principle. For fixed n N consider the class Poly n of polynomials in the variables x ij Consider the following polynomial equations: ....

Beame, P., Impagliazzo, R., Krajicek, J., Pitassi, T., Pudlak, P.: Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society 73(3) 1-26 (1996) 30

.... proved that whenever p, q are distinct primes, the propositional formulas Count qn 1 q do not have polynomial size, bounded depth Frege proofs THE COMPLEXITY OF PROPOSITIONAL PROOFS 461 from instances of Count m p , where m ## 0 (mod p) Beame, Impagliazzo, Kraj cek, Pitassi and Pudl ak [6] extended this result to composite p and q. The preceding results are significant not just from the point of view of propositional complexity theory, but also as providing independence results in systems of bounded arithmetic. The system I # 0 of first order bounded arithmetic introduced by ....

Paul Beame, Russell Impagliazzo, Jan Kraj cek, Toniann Pitassi, and Pavel Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society THE COMPLEXITY OF PROPOSITIONAL PROOFS 465 Press, 1994, pp. 794--806.

....between the two areas ( Raz96, BP98] The propositional proof systems which recently received much attention are so called algebraic proof systems simulating the most basic algebraic facts and constructions. The idea to use algebraic machinery in the proof complexity originally appeared in [BIKPP94] who defined the Nullstellensatz refutation system motivated by Hilbert s Nullstellensatz. CEI96] introduced an even more natural algebraic proof system that directly simulates the process of generating an ideal from a finite set of generators, called Polynomial Calculus (PC for short) This ....

P. Beame, R. Impagliazzo, J. Krajcek, T. Pitassi, and P. Pudlak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. In Proceedings of the 35th IEEE FOCS, 1994, 794--806. Journal version to appear in Proc. of the London Math. Soc.

....Society 1052 1798 00 1.00 .25 per page 1 2 JAN JOHANNSEN if the binary connectives were of unbounded arity. Constant depth Frege systems and some extensions of these by additional, non schematic axioms (like pigeonhole and counting principles) are known not to be polynomially bounded [1, 4, 2, 5, 3]. A recurring theme in the theory of propositional proof systems is the correspondence of certain proof systems to certain complexity classes. So e.g. extended Frege systems correspond to P , Frege systems to NC 1 and constant depth Frege systems to AC 0 . The first of these correspondences ....

....P. Clote [10] defined calculi ALV and AV for equations between functions in NC 1 and AC 0 resp. and showed that proofs in these calculi can be simulated by polynomial size Frege proofs and constant depth Frege proofs respectively. Recently, extensions of Frege systems by modular counting [3] and threshold connectives [15, 7] were introduced, where constant depth proofs in these intuitively correspond to the circuit complexity classes ACC(m) and TC 0 . We support this intuition by defining equational calculi A2V for functions in ACC(2) and TV for functions in TC 0 and showing that ....

[Article contains additional citation context not shown here]

Paul Beame, Russell Impagliazzo, Jan Kraj'icek, Toniann Pitassi, and Pavel Pudl'ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proc. London Math. Soc. 73 (1996), 1--26.

No context found.

P. Beame, R. Impagliazzo, J. Kraj   cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, (3) 73, (1996), pp.1-26.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, 73 (1996), pp. 1--26.

No context found.

P. Beame, R. Impagliazzo, J. Kraj'icek, T. Pitassi, and P. Pudl'ak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc., 73:1--26, 1996.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, vol. 73 (1996), pp. 1--26.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, 73 (1996), pp. 1--26.

No context found.

Paul W. Beame, Russell Impagliazzo, Jan Kraj'icek, Toniann Pitassi, and Pavel Pudl'ak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 794--806, Santa Fe, NM, November 1994. IEEE.

.... strategy is to use randomized DavisPutnam DLL algorithms and re start them with di erent random bits if they begin to take too long [21, 20] It has previously been shown that Davis Putnam DLL algorithms are exponentially inecient for proving unsatis ability for typical unsatis able formulas [13, 7, 9, 6, 8] and thus there must be rare satis able formulas close to these unsatis able formulas that cause such algorithms to have exponential behavior. Nonetheless, their relative rarity makes it hard for us to lay hands on any single such formula. Thus, prior to this work, there was no known method to ....

P. W. Beame, R. Impagliazzo, J. Krajcek, T. Pitassi, and P. Pudlak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 794-806, Santa Fe, NM, November 1994. IEEE.

....I 0 ( and I 0 ( top is as described above, taking n such that some power n k bounds . Example 8.2. Let p; q be two di erent primes. There is a structure M whose Grothendieck ring K 0 (M ) admits F q as a quotient but not F p . In particular, K 0 (M ) does not admit Zas a quotient. By [2] there is a model N of I 0 ( that satis es 0 ( Count q but not the 0 ( Count p (the counting principles are also restricted to non co nal sets) The COMBINATORICS WITH DEFINABLE SETS 15 structure M is a suitable model of I 0 ( top , obtained from N as above. By Theorem 3.9 the ....

P. Beame, R. Impagliazzo, J. Kraj   cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, (3) 73, (1996), pp.1-26.

No context found.

P. Beame, R. Impagliazzo, J. Krajicek, T. Pitassi, and P. Pudlak. Lower bounds on hilbert's nullstellensatz and propositional proofs. In Proceedings of the 35th Annual Symposium on Foundations Of Computer Science, pages 794--806. IEEE, November 1994.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society, 73:1--26, 1996.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, 73 (1996), pp. 1--26.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, in Thirty-fifth Annual Symposium on Foundations of Computer Science, IEEE Press, 1994, pp. 794--806. Revised version to appear in Proceedings of the London Mathematical Society.

No context found.

P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi, and P. Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Proceedings of the London Mathematical Society, 73 (1996), pp. 1--26.

No context found.

Paul Beame, Russell Impagliazzo, Jan Kraj  icek, Toniann Pitassi, and Pavel Pudlak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc., 3(73):1-26, 1996.

No context found.

P. Beame, R. Impagliazzo, J. Krajcek, T. Pitassi, and P. Pudlak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc., 73(3):1-26, 1996.

No context found.

P. Beame, R. Impagliazzo, J. Krajcek, T. Pitassi, and P. Pudlak. Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc., 73(3):1-26, 1996.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC