Introduction and survey papers.
This is a preliminary version of the catalog of NP optimization problems.
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.
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
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.
A proposal for solving NP-hard problems.
An online course on complexity.
People, publications, prizes.
A collection of bookmarks by Heribert Vollmer.
Research group in the Computing Laboratory, Oxford University.