HubHip: Computers: Computer Science: Theoretical: Complexity Theory (158)

DescriptionThe study of algorithmic complexity. A topic of particular interest is the relationship between polynomial-time (P) and non-deterministic polynomial-time (NP), the latter consisting of algorithms for which there is a P solution given the right initial guess (often called witness or certificate).

Complexity Theory

Challenging Benchmarks for SAT and CSP (Site) - Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
Theory of Computation, Fall 2006 (Site) - Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.
SAT Live! (Site) - A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
Lecture notes on Complexity (Site) - Collection of lecture notes by Prof. Eric Allender, Rutgers University.
Computability and Complexity (Site) - An online course on complexity.
A Compendium of NP Optimization Problems (Site) - This is a preliminary version of the catalog of NP optimization problems.
Information-based Complexity (Site) - People, publications, prizes.
Average-Case Complexity Forum (Site) - Introduction and survey papers.
Constraint Satisfaction Problems (Site) - Research group in the Computing Laboratory, Oxford University.
IBM Research: Algorithms & Theory (Site) - An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Parameterized Complexity (Site) - Brief description, list of workers and problem compendium, compiled by Todd Wareham.
Computational Complexity Theory (Site) - Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol
Probabilistically Checkable Proofs and Approximation (Site) - Pointers to some survey articles and their authors, by M. Bellare.
Complexity Theory (Site) - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
Algorithms and Complexity Research Area (Site) - The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.
SATLIB - The Satisfiability Library (Site) - 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.
Complexity of Algorithms (Site) - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
ECCC - Electronic Colloquium on Computational Complexity (Site) - 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.
Computational Complexity Theory (Site) - Wikipedia article.
Complexity Zoo (Site) - Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.
Computational Complexity and Programming Languages (Site) - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
Efficient algorithms and intractable problems (Site) - Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
Computational Complexity Theory (Site) - Definition of the subject, links.
Automata, Computability, and Complexity, Spring 2005 (Site) - Course 6.045J / 18.400J at MIT OpenCourseWare with introduction to basic mathematical models of computation, Turing machines, Church's Thesis, time complexity and NP-completeness.
$1 million for solving P vs NP (Site) - One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
Theoretical Computer Science links (Site) - A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover.