|
167
|
Separating the Polynomial-Time Hierarchy by Oracles
– A Yao
- 1985
|
|
262
|
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
– Roman Smolensky
- 1987
|
|
168
|
The complexity of finite functions
– R B Boppana, M Sipser
- 1992
|
|
115
|
circuits, and the polynomial time hierarchy
– M L FURST, J B SAXE, M Parity SIPSER
|
|
1478
|
The probabilistic method
– Joel Spencer
- 1992
|
|
67
|
Borel Sets and Circuit Complexity
– M Sipser
- 1983
|
|
88
|
Sigma 1 formulae on finite structures
– M Ajtai
|
|
28
|
Solving 3-satisfiability in less than 1.579 n steps
– I Schiermeyer
- 1993
|
|
11
|
Solving Satisfiability
– B Monien, E Speckenmeyer
- 1985
|
|
11
|
Top– Down Lower Bounds for Depth 3
– J H˚astad, S Jukna, P Pudlák
- 1993
|
|
12
|
Exponential Lower Bounds for Depth 3 Boolean Circuits
– Ramamohan Paturi, Michael E. Saks, Francis Zane
- 1997
|
|
46
|
bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41
– A A Razborov, Lower
- 1987
|
|
71
|
Graph-theoretic arguments in low-level complexity
– Leslie G Valiant
- 1977
|
|
117
|
Exponential lower bounds for the pigeonhole principle
– P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák, A Woods
- 1992
|
|
69
|
Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53
– J Paris, A Wilkie, A Woods
- 1988
|
|
28
|
On time-hardware complexity tradeoffs for Boolean functions
– P M Spira
- 1971
|
|
100
|
Constant depth reducibility
– A K Chandra, L Stockmeyer, U Vishkin
- 1984
|
|
244
|
The intractability of resolution
– Armin Haken
- 1985
|
|
139
|
On uniform circuit complexity
– W L Ruzzo
- 1981
|
