Complexity Theory Theoretical Computer Science

The 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 - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
  
• Computational Complexity Theory - Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol
  
• Automata, Computability, and Complexity, Spring 2005 - 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.
  
• Efficient algorithms and intractable problems - Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
  
• $1 million for solving P vs NP - One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
  
• Lecture notes on Complexity - Collection of lecture notes by Prof. Eric Allender, Rutgers University.
  
• Complexity of Algorithms - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
  
• Parameterized Complexity - Brief description, list of workers and problem compendium, compiled by Todd Wareham.
  
• SAT Live! - A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
  
• The NP-Complete Arcade - Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard.
  
• IBM Research: Algorithms & Theory - An overview of computational models and methods and how they relate to complexity, with links to selected papers.
  
• Complexity Zoo - Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.
  
• Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
  
• 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.
  
• Computability and Complexity - An online course on complexity.
  
• Theory of Computation, Fall 2006 - Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.
  
• 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.
  
• Theoretical Computer Science links - A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover.
  
• 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.
  
• Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.
  
• Probabilistically Checkable Proofs and Approximation - Pointers to some survey articles and their authors, by M. Bellare.
  
• Information-based Complexity - People, publications, prizes.
  
  

Copyright © 1995-2009 Internet Advertising Solutions, Inc.
Copyright Notice | Privacy Policy | Site Map | APR