  |
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. |
| |
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. |
| |
Complexity Theory - http://www.wisdom.weizmann.ac.il/~oded/cc.html
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute. |
| |
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. |
| |
Lecture notes on Complexity - http://www.cs.rutgers.edu/~allender/lecture.notes/
Collection of lecture notes by Prof. Eric Allender, Rutgers University. |
| |
Average-Case Complexity Forum - http://www.uncg.edu/mat/avg/
Introduction and survey papers. |
| |
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 and Programming Languages - http://www.cis.syr.edu/people/royer/talks.html
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer. |
| |
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. |
| |
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. |
| |
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. |
 |
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. |
| |
Constraint Satisfaction Problems - http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html
Research group in the Computing Laboratory, Oxford University. |
| |
$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). |
| |
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. |