Lower Bounds for the Size of Circuits of Bounded Depth in Basis (1986)
by
A. A. Razborov
,
Mark Alan Epstein
| Citations: | 75 - 0 self |
BibTeX
@MISC{Razborov86lowerbounds,
author = {A. A. Razborov and Mark Alan Epstein},
title = {Lower Bounds for the Size of Circuits of Bounded Depth in Basis},
year = {1986}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we consider circuits of bounded depth in the basis f; \Phig.
Citations
| 199 | Parity, circuits, and the polynomial-time hierarchy - Furst, Saxe, et al. - 1981 |
| 167 | Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985 |
| 121 | Lower bounds for the monotone complexity of some boolean functions - Razborov - 1985 |
| 116 | The monotone circuit complexity of boolean functions - Alon, Boppana - 1987 |
| 92 | Σ 1 1-formulae on finite structures - Ajtai - 1983 |
| 25 | A boolean function requiring 3n network size - Blum - 1984 |
| 16 | Threshold functions and bounded depth monotone circuits - Boppana - 1984 |
| 15 | bounds on monotone complexity of the logical permanent - Razborov, Lower - 1985 |
| 11 | On monotone formulae with restricted depth - Klawe, Paul, et al. - 1984 |
| 9 | Exponential lower bounds for restricted monotone circuits - VALIANT |
| 1 | Both Single Method Polynomial Lower Bounds on the Complexity of Individual Monotone Functions - Andreev - 1985 |
| 1 | Lower Bounds in Algebraic Computational Complexity, " Theorems - Gregoryev - 1982 |
