Bounded Arithmetic (1986)

by Samuel R. Buss
Citations:68 - 2 self

Active Bibliography

Turing and the Development of Computational Complexity – Steven Homer, Alan L. Selman - 2011
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
52 Complexity Classes Defined By Counting Quantifiers – Jacobo Torán - 1991
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
Expressing vs. proving: relating forms of complexity in logic – Antonina Kolokolova
6 A Fundamental Problem of Mathematical Logic – Jan Krajicek
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
7 Immunity and Simplicity for Exact Counting and Other Counting Classes – Jörg Rothe - 1998
Pivoted at NEXP ⊂ ACC 0 – Gil Cohen Preface, Sagie Benaim, Dean Doron, Anat Ganor, Elazar Goldenberg, Tom Gur, Ami Mor, Shani Nitzan, Bharat Ram Rangarajan, Daniel Reichman, Ron D, Uri Sherman, Igor Shinkar, Avishay Tal, Tal Wagner, Eylon Yogev
230 Languages That Capture Complexity Classes – Neil Immerman - 1987
28 An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic – Alexander A. Razborov - 1993
2 Tally NP Sets and Easy Census Functions – Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe - 1998
Alternative notions of approximation and space-bounded computations – Alina Beygelzimer - 2003
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
9 On Cluster Machines and Function Classes – Sven Kosub - 1997
2 Computational Complexity Theory – Michael Loui - 1996
1 Reducibility and Completeness – By Eric Allender, Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
10 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
20 Finite-Model Theory - A Personal Perspective – Ronald Fagin - 1993