Skip to main content

Lower bounds for resolution and cutting plane proofs and monotone computations

  • Pavel Pudlák (a1)

We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use nondecreasing functions as gates. The latter result is of independent interest, since, in particular, it implies an exponential lower bound for some arithmetic circuits.

Hide All
[1]Ajtai, M., The complexity of the pigeonhole principle, Proceedings of the 29-th FOCS, 1988, pp. 346355.
[2]Alon, N. and Boppana, R.B., The monotone circuit complexity of Boolean functions, Combinatorica, vol. 7 (1987), no. 1, pp. 122.
[3]Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P., and Woods, A., Exponential lower bounds for the pigeonhole principle, Proc. 24-th STOC, 1992, pp. 200221.
[4]Bonet, M., Pitassi, T., and Raz, R., Lower bounds for cutting planes proofs with small coefficients, Proc. 27-th STOC, 1995, pp. 575584.
[5]Buss, S. R. and Clote, P., Cutting planes, connectivity, and threshold logic, Archive for Mathematical Logic, to appear.
[6]Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics, vol. 4 (1973), pp. 305337.
[7]Chvátal, V., Some linear programming aspects of combinatorics, Proceedings of the Conference on Algebraic Aspects of Combinatorics, Toronto 1975, Utilitas Mathematical Publishing Inc., Winnipeg, 1975, pp. 230.
[8]Chvátal, V., Cook, W., and Martmann, M., On cutting plane proofs in combinatorial optimization, Linear Algebra and Its Applications, vol. 114/115 (1989), pp. 455499.
[9]Cook, W., Coullard, C. R., and Turán, Gy., On the complexity of cutting plane proofs, Discrete Applied Mathematics, vol. 18 (1987), pp. 2538.
[10]Craig, W., Linear reasoning: A new form of the Herbrand-Gentzen theorem, this Journal, vol. 22 (1957), no. 3, pp. 250287.
[11]Craig, W., Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory, this Journal, vol. 22 (1957), no. 3, pp. 269285.
[12]Gomory, R. E., An algorithm for integer solutions of linear programs, Recent advances in mathematical programming (Graves, R. L. and Wolfe, P., editors), McGraw-Hill, 1963, pp. 269302.
[13]Haken, A., The intractability of resolution, Theoretical Computer Science, vol. 39 (1985), pp. 297308.
[14]Haken, A., Counting bottlenecks to show monotone P ≠ NP, Proc. 36-th Annual IEEE Symp. on Foundations of Computer Science (Milwaukee), 1995, pp. 3640.
[15]Impagliazzo, R., Pitassi, T., and Urquhart, A., Upper and lower bounds for tree-like cutting planes proofs, Proc. 9-th Annual IEEE Symp. on Logic in Computer Science, 1994, pp. 220228.
[16]Krajíček, J., Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, this Journal, to appear.
[17]Krajíček, J., Lower bounds to the size of constant-depth propositional proofs, this Journal, vol. 59 (1994), no. 1, pp. 7386.
[18]Krajíček, J., Bounded arithmetic, propositional logic and complexity theory, Cambridge University Press, 1995.
[19]Krajíček, J. and pudlák, P., Some consequences of cryptographical conjectures for S21 and EF, Logic and computational complexity, Lecture Notes in Computer Science, vol. 960, Springer-Verlag, 1995, pp. 210220.
[20]Papadimitriou, Ch. H. and Steiglitz, K., Combinatorial optimization: Algorithms and complexity, Prentice-Hall, 1982.
[21]Paris, J. B., Wilkie, A. J., and Woods, A. R., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), pp. 12351244.
[22]Razborov, A. A., Lower bounds on the monotone complexity of some Boolean functions, Doklady Akad. Nauk SSSR, vol. 282 (1985), pp. 10331037.
[23]Razborov, A. A., Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izvestiya of the R.A.N., vol. 59 (1995), no. 1, pp. 201222, Izvestiya: Mathematics, vol. 59, no. 1, pp. 205–227.
[24]Schnorr, C. P., A lower bound on the number of additions in monotone computations, Theoretical Computer Science, vol. 2 (1976), pp. 305315.
[25]Schrijver, A., On cutting planes, Combinatorics, vol. 79 (1980).
[26]Schrijver, A., On cutting planes, part II, Annals of Discrete Math., vol. 9, North-Holland, 1980, pp. 291296.
[27]Wegener, I., The complexity of Boolean functions, Teubner and Wiley, 1987.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed