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