  |
Computational Complexity Theory - http://en.wikipedia.org/wiki/Computational_complexity_theory
Wikipedia article. |
| |
$1 million for solving P vs NP - http://www.claymath.org/millennium/P_vs_NP/
One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI). |
| |
SAT Live! - http://www.satlive.org/
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well. |
| |
SATLIB - The Satisfiability Library - http://www.satlib.org/
A collection of benchmark problems, solvers, and tools. Provides a uniform test-bed for SAT solvers as well as a site for collecting SAT problem instances, algorithms, and empirical characterisations of the algorithms' performance. |
| |
Complexity Zoo - http://qwiki.stanford.edu/wiki/Complexity_Zoo
Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project. |
| |
Information-based Complexity - http://www.ibc-research.org/
People, publications, prizes. |
| |
Automata, Computability, and Complexity, Spring 2005 - http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JSpring-2005/CourseHome/index.htm
Course 6.045J / 18.400J at MIT OpenCourseWare with introduction to basic mathematical models of computation, Turing machines, Church's Thesis, time complexity and NP-completeness. |
| |
Theory of Computation, Fall 2006 - http://ocw.mit.edu/OcwWeb/Mathematics/18-404JFall-2006/CourseHome/
Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory. |
| |
A Compendium of NP Optimization Problems - http://www.nada.kth.se/~viggo/problemlist/compendium.html
This is a preliminary version of the catalog of NP optimization problems. |
| |
Probabilistically Checkable Proofs and Approximation - http://www-cse.ucsd.edu/users/mihir/pcp.html
Pointers to some survey articles and their authors, by M. Bellare. |
| |
The NP-Complete Arcade - http://hagaregn.org.uk/npsudoku/index.html
Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard. |
| |
Complexity of Algorithms - http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format. |
| |
Parameterized Complexity - http://www.cs.mun.ca/~harold/W_hier/W_hier.html
Brief description, list of workers and problem compendium, compiled by Todd Wareham. |
| |
Computational Complexity Theory - http://www.cs.umass.edu/~immerman/complexity_theory.html
Definition of the subject, links. |
| |
ECCC - Electronic Colloquium on Computational Complexity - http://eccc.hpi-web.de/
A forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. Research reports, surveys and books; meetings, discussions and web resources. |