Monotone Complexity (1990)

by Michelangelo Grigni , Michael Sipser
Citations:2340 - 12 self

Active Bibliography

10 Combinatorial Methods In Boolean Function Complexity – Anna Gál - 1995
50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
Boolean Circuits – Jan Krajicek - 2000
14 Lower bounds in a parallel model without bit operations – Ketan Mulmuley - 1997
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
1 Combinatorics in Computer Science – L. Lovász, D.B. Shmoys, É. Tardos - 1990
46 Bounded Arithmetic and Lower Bounds in Boolean Complexity – Alexander A. Razborov - 1993
6 A Fundamental Problem of Mathematical Logic – Jan Krajicek
16 Non-uniform ACC circuit lower bounds – Ryan Williams - 2010
2 Complexity Classes – Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
9 Computational Complexity – Oded Goldreich, Avi Wigderson - 2004
2 The Complexity of Resource-Bounded Propositional Proofs – Albert Atserias - 2001
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
Pebble Games and Complexity – Siu Man Chan - 2013
unknown title – Boolean Circuit Lower Bounds, Lecturer Avi Wigderson, Scribers V. Anuradha, Yuri Pritykin
unknown title – Boolean Circuit Lower Bounds, Lecturer Avi Wigderson, Scribers V. Anuradha, Yuri Pritykin
54 Unprovability of Lower Bounds on the Circuit Size in Certain Fragments of Bounded Arithmetic – Er A. Razborov - 1995
57 Models of Computation -- Exploring the Power of Computing – John E. Savage