|
374
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
267
|
Some complexity questions related to distributed computing
– Yao
- 1979
|
|
247
|
The relative efficiency of propositional proof systems
– Cook, Reckhow
- 1979
|
|
230
|
The intractability of resolution
– Haken
- 1985
|
|
134
|
Monotone Circuits for Connectivity Require Super-logarithmic Depth
– Karchmer, Wigderson
- 1990
|
|
129
|
Natural proofs
– Razborov, Rudich
- 1997
|
|
128
|
An algorithm for integer solutions to linear programs
– Gomory
- 1963
|
|
120
|
Exponential lower bounds for the pigeonhole principle
– Pitassi, Beame, et al.
- 1993
|
|
120
|
Lower bounds on the monotone complexity of some boolean functions
– Razborov
- 1985
|
|
114
|
The monotone circuit complexity of boolean functions
– Alon, Boppana
- 1987
|
|
101
|
Edmonds polytopes and a hierarchy of combinatorial problems
– Chvátal
- 1973
|
|
70
|
Some consequences of cryptographic conjectures for S12
– Kraj'icek, Pudl'ak
- 1995
|
|
66
|
Provability of the pigeonhole principle and the existence of infinitely many primes
– Paris, Wilkie, et al.
- 1988
|
|
65
|
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
– Krajíček
- 1997
|
|
61
|
Monotone Circuits for Matching Require Linear Depth
– Raz, Wigderson
- 1992
|
|
59
|
Polynomial size proofs of the Propositional Pigeonhole Principle
– Buss
- 1987
|
|
53
|
Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic
– Razborov
- 1995
|
|
44
|
Lower bounds to the size of constant-depth propositional proofs
– Krajíček
- 1994
|
|
43
|
On the complexity of cutting plane proofs
– Cook, Coullard, et al.
- 1987
|
|
43
|
Upper and lower bounds on tree-like cutting planes proofs
– Impagliazzo, Pitassi, et al.
- 1994
|
|
24
|
Probabilistic communication complexity of boolean relations
– Raz, Wigderson
- 1989
|
|
18
|
Communication Complexity: A New Approach to Circuit Depth
– Karchmer
- 1989
|
|
15
|
Cutting planes, connectivity and threshold logic
– Buss, Clote
- 1996
|
|
12
|
Cutting plane versus frege proof systems
– Goerdt
- 1990
|
|
6
|
Cutting planes and constant depth Frege proofs
– Clote
- 1992
|
|
2
|
Randomized versus nondeterministic communication complexity
– Beame, Lawry
- 1992
|
|
2
|
Lower Bounds for Probabilistic Communication Complexity and for the depth of Monotone Boolean Circuits
– Raz
- 1992
|
|
2
|
The complexity of the pigeonhole principle," forthcoming. Preliminary version
– Ajtai
- 1988
|
|
1
|
The complexity of the pigeonhole principle, " forthcoming. Preliminary version
– Ajtai
- 1988
|
|
