We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean functions in non-monotone models fall within our definition of natural. We show based on a hardness assumption that natural proofs can't prove super-polynomial lower bounds for general circuits. Without the hardness assumption, we are able to show that they can't prove exponential lower bounds (for general circuits) for the discrete logarithm problem. We show that the weaker class of AC 0-natural proofs which is sufficient to prove the parity lower bounds of Furst, Saxe, and Sipser, Yao, and Hastad is inherently incapable of proving the bounds of Razborov and Smolensky. We give some formal evidence that natural proofs are indeed natural by showing that every formal complexity measure which can prove super-polynomial lower bounds for a single function, can do so for almost
|
480
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
466
|
How to generate Cryptographically Strong Sequences of Pseudo-Random Bits
– Blum, Micali
- 1984
|
|
415
|
Theory and applications of trapdoor functions
– Yao
- 1982
|
|
304
|
The complexity of Boolean functions
– Wegener
- 1987
|
|
239
|
Algebraic methods in the theory of lower bounds for boolean circuit complexity. 19th STOC
– Smolensky
- 1987
|
|
199
|
Constant depth circuits, Fourier transform, and learnability
– Linial, Mansour, et al.
- 1993
|
|
157
|
Separating the polynomial-time hierarchy by oracles
– Yao
- 1985
|
|
135
|
Pseudorandomness and Cryptographic Applications
– Luby
- 1996
|
|
134
|
Monotone Circuits for Connectivity Require Super-logarithmic Depth
– Karchmer, Wigderson
- 1990
|
|
125
|
Computational limitations on small depth circuits
– H˚astad
- 1986
|
|
115
|
Parity, circuits and the polynomial time hierarchy
– Furst, Saxe, et al.
- 1984
|
|
114
|
The monotone circuit complexity of boolean functions
– Alon, Boppana
- 1987
|
|
108
|
Threshold circuits of bounded depth
– Hajnal, Maass, et al.
- 1987
|
|
108
|
On span programs
– Karchmer, Wigderson
- 1993
|
|
106
|
Lower bounds for resolution and cutting plane proofs and monotone computations
– Pudlák
|
|
96
|
Sigma 1 -formulae on finite structures
– Ajtai
- 1983
|
|
89
|
Lower bounds for cutting planes proofs with small coefficients
– Bonet, Pitassi, et al.
- 1997
|
|
68
|
The Expressive Power of Voting Polynomials
– Aspnes, Beigel, et al.
- 1994
|
|
66
|
Efficient cryptographic schemes provably as secure as subset sum
– Impagliazzo, Naor
- 1996
|
|
61
|
Monotone Circuits for Matching Require Linear Depth
– Raz, Wigderson
- 1992
|
|
53
|
Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic
– Razborov
- 1995
|
|
49
|
The gap between monoton and non-monotone circuit complexity is exponential
– Tardos
- 1987
|
|
37
|
Pseudorandom bits for constant depth circuits
– Nisan
- 1991
|
|
32
|
On provably disjoint NP-pairs
– Razborov
- 1994
|
|
27
|
Lower bounds for propositional proofs and independence results in bounded arithmetic
– Razborov
- 1996
|
|
23
|
Threshold logic and its applications. Wiley-Interscience
– Muroga
- 1971
|
|
12
|
Shrinkage of de Morgan formulae under restriction
– Paterson, Zwick
- 1993
|
|
11
|
A note on a theorem of Razborov
– Barrington
- 1986
|
|
10
|
The fusion method for lower bounds in circuit complexity
– Wigderson
- 1993
|
|
10
|
Succinct certificates for almost all subset sum problems
– Furst, Kannan
- 1989
|
|
9
|
i cek, Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic
– Kraj
- 1994
|
|
8
|
The shrinkage exponent is 2
– Hastad
- 1993
|
|
8
|
The effect of random restrictions on formulae size
– Nisan, Impagliazzo
- 1993
|
|
8
|
Ninie ocenki razmera shem ograniqenno$i glubiny v polnom bazise, soderawem funkci logiqeskogo sloeni
– Razborov
- 1987
|
|
5
|
O metode poluqeni bolee qem kvadratiqnyh ninih ocenok dl slonosti -shem. Vestnik MGU, ser. matem i mehan., t
– Andreev
- 1987
|
|
4
|
On submodular complexity measures
– Razborov
- 1992
|
|
3
|
cek, Bounded Arithmetic
– Kraj
- 1995
|
|
2
|
Ob odnom metode poluqeni ninih ocenok slonosti individual~nyh monotonnyh funkci$i
– Andreev
- 1985
|
|
2
|
Ob odnom metode poluqeni ffffektivnyh ninih ocenok monotonno$i slonosti. Algebra i logika
– Andreev
- 1987
|
|
2
|
Ninie ocenki monotonno$i slonosti nekotoryh bulevyh funkci$i
– Razborov
- 1985
|
|
2
|
Ninie ocenki monotonno$i slonosti logiqeskogo permanenta
– Razborov
- 1985
|
|
1
|
Ninie ocenki slonosti realizacii simmetriqeskih bulevyh funkci$i kontaktno-ventil~nymi shemami
– Razborov
- 1990
|
|
1
|
On small size approximation models. To appear in the volume The Mathematics of Paul Erdos
– Razborov
- 1993
|
|
1
|
Natural Proofs. 26th Annual Symposium on Theory of Computing
– Razborov, Rudich
- 1994
|
