Concepedia
Computational Complexity · 1994 · 105 citations · 24 references
Natural SciencesComputer ScienceMathematicsAlgebraCombinatoricsNumber TheoryBoolean AlgebraBoolean OperationsDigital Logic DesignGenerating FunctionsBoolean Algebra In Circuit DesignBoolean EquationsBoolean Function DecompositionBoolean Function RepresentationBoolean Functions
24
Parity, circuits, and the polynomial-time hierarchy
Merrick L. Furst, James B. Saxe, Michael Sipser · Theory of Computing Systems · 1984 · 939 citations
Computing, Computer Engineering, Computer Science +11
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
Roman Smolensky · 1987 · 760 citations · Full text
Computing, Computer Science, Mathematics +16
Bounded-width polynomial-size branching programs recognize exactly those languages in <i>NC</i><sup>1</sup>
David A. Mix Barrington · 1986 · 686 citations
Computing, Computer Science, Mathematics +6
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
David A. Mix Barrington · Journal of Computer and System Sciences · 1989 · 407 citations
Computing, Computer Science, Algorithms +9
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
Alexander Razborov · Mathematical Notes · 1987 · 394 citations
Computing, Computer Engineering, Computer Science +12