Complexity Theory
A Compendium of NP Optimization Problems
This is a preliminary version of the catalog of NP optimization problems.
Algorithms and Complexity
A collection of bookmarks by Heribert Vollmer.
Algorithms and Complexity
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Algorithms and Complexity Research Area
The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.
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.
Complexity of Algorithms
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
Complexity Theory
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
Computational Complexity and Programming Languages
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
Constraint Satisfaction Problems
Research group in the Computing Laboratory, Oxford University.
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 we…
Lecture notes on Complexity
Collection of lecture notes by Prof. Eric Allender, Rutgers 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.
Showing 20–20 of 22 results