Active Bibliography

11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
19 Holographic Algorithms: From Art to Science – Jin-yi Cai, Pinyan Lu - 2007
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
Turing and the Development of Computational Complexity – Steven Homer, Alan L. Selman - 2011
P versus NP – Elvira Mayordomo - 2004
Postman Problems on Mixed Graphs – Francisco Javier Zaragoza Martinez - 2003
2 Computational Complexity Theory – Michael Loui - 1996
20 Finite-Model Theory - A Personal Perspective – Ronald Fagin - 1993
The New Prehistory – David S. Johnson
A Brief History of NP-Completeness, 1954–2012 – David S. Johnson - 2012
A Structural View Of Approximation – Sanjeev Khanna, Rajeev Motwani - 1996
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
1 A Status Report on the P versus NP Question – Eric Allender
A New Class of Holographic Algorithms: Fibonacci Gates – n.n.
26 Inapproximability of combinatorial optimization problems – Luca Trevisan - 2004
6 Bases Collapse in Holographic Algorithms – Jin-yi Cai - 2007
1 Efficient Approximation Algorithms for Some Semidefinite Programs – Hsueh-i Lu, N. Klein, Franco P. Preparata, Pascal Van Hentenryck - 1996
936 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
8 Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems – Madhav V. Marathe, Harry B. Hunt III, Richard E. Stearns, Venkatesh Radhakrishnan - 1998