- Average-Case Complexity Forum - Introduction and survey papers.
- A Compendium of NP Optimization Problems - This is a preliminary version of the catalog of NP optimization problems.
- 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.
- Roberto Bayardo's Resources - Includes the relsat SAT solver and related papers.
- SAT Live! - 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 - 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.
- Stas Busygin's NP-Completeness Page - A proposal for solving NP-hard problems.
- Computability and Complexity - An online course on complexity.
- Information-based Complexity - People, publications, prizes.
- Algorithms and Complexity - A collection of bookmarks by Heribert Vollmer.
- Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.
- Parameterized Complexity - Brief description, list of workers and problem compendium, compiled by Todd Wareham.
- Probabilistically Checkable Proofs and Approximation - Pointers to some survey articles and their authors, by M. Bellare.
- Algorithms and Complexity Research Area - The Oxford University Computing Laboratory's area on Algorithms and complexity, with links to lectures and information.
- Complexity of Algorithms - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
- Algorithms and Complexity - An overview of computational models and methods and how they relate to complexity, with links to selected papers.
- Computational Complexity Theory - Wikipedia article.
- Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
- Computational Complexity Theory - Definition of the subject, links.
- P vs NP - Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
- Complexity Theory - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
- Lecture notes on Complexity - Collection of lecture notes by Prof. Eric Allender, Rutgers University.
- Challenging Benchmarks for SAT and CSP - Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
|
