  |
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. |
| |
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. |
| |
Efficient algorithms and intractable problems - http://www-inst.eecs.berkeley.edu/~cs170/fa06/
Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley. |
| |
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. |
| |
IBM Research: Algorithms & Theory - http://domino.research.ibm.com/comm/research.nsf/pages/r.algorithms.html
An overview of computational models and methods and how they relate to complexity, with links to selected papers. |
| |
Challenging Benchmarks for SAT and CSP - http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm
Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004. |
| |
Computational Complexity Theory - http://www.cs.bris.ac.uk/Teaching/Resources/COMS30126/
Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol |
| |
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. |
| |
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. |
| |
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. |
 |
Theoretical Computer Science links - http://www.thi.uni-hannover.de/en/research/links/
A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover. |