Almost Optimal Lower Bounds for Small Depth Circuits (1989)

by Johan Håstad
Venue:RANDOMNESS AND COMPUTATION
Citations:237 - 7 self

Documents Related by Co-Citation

286 Algebraic methods in the theory of lower bounds for Boolean circuit complexity – R Smolensky - 1987
185 Separating the polynomial-time hierarchy by oracles – A Yao - 1985
176 The complexity of finite functions – R B Boppana, M Sipser - 1990
1707 The probabilistic method – N Alon, J Spencer
121 Parity Circuits and the Polynomial Time Hierarchy – M Furst, J Saxe, M Sipser - 1984
88 Sigma 1 formulae on finite structures – M Ajtai
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
13 Exponential Lower Bounds for Depth 3 Boolean Circuits – Ramamohan Paturi, Michael E. Saks, Francis Zane - 1997
30 Solving 3-satisfiability in less than 1.579 n steps – Ingo Schiermeyer - 1993
50 bounds on the size of bounded depth networks over a complete basis with logical addition – A Razborov, Lower - 1987
103 Graph-theoretic arguments in low-level complexity – Leslie G Valiant - 1977
71 A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes – J B Paris, A J Wilkie, Woods - 1988
123 Exponential lower bounds for the pigeonhole principle – Paul W Beame, Toniann Pitassi, Russel Impagliazzo - 1993
74 Borel sets and circuit complexity – M Sipser - 1983
38 On time hardware complexity tradeoffs for Boolean functions – P M Spira - 1971
107 Constant depth reducibility – A K Chandra, L Stockmeyer, U Vishkin - 1984
264 The intractability of resolution – A Haken - 1985
151 On uniform circuit complexity – W L Ruzzo - 1981