MetaXearch > / Computer Science / Theoretical / Complexity Theory /
Average-Case Complexity Forum
Introduction and survey papers. (infos)A Compendium of NP Optimization Problems
This is a preliminary version of the catalog of NP optimization problems. (infos)
ECCC - Electronic Colloquium on Computational Complexity
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. (infos)
Roberto Bayardo's Resources
Includes the relsat SAT solver and related papers. (infos)
SAT Live!
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well. (infos)
SATLIB - The Satisfiability Library
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. (infos)
Stas Busygin's NP-Completeness Page
A proposal for solving NP-hard problems. (infos)
Computability and Complexity
An online course on complexity. (infos)
Information-based Complexity
People, publications, prizes. (infos)
Algorithms and Complexity
A collection of bookmarks by Heribert Vollmer. (infos)