Open Directory - Computers: Computer Science: Theoretical: Complexity Theory
- One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI). - This is a preliminary version of the catalog of NP optimization problems. - Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004. - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute. - Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project. - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format. - An online course on complexity. - Wikipedia article. - Definition of the subject, links. - Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer. - Research group in the Computing Laboratory, Oxford University. - 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. - Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley. - An overview of computational models and methods and how they relate to complexity, with links to selected papers. - People, publications, prizes. - Collection of lecture notes by Prof. Eric Allender, Rutgers University. - Brief description, list of workers and problem compendium, compiled by Todd Wareham. - Pointers to some survey articles and their authors, by M. Bellare. - A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well. - 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. - Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard.
