HIGH-FLYER ARCHIVES       AVERAGE ARCHIVES       GERMAN ARCHIVES       OTHER RESOURCES       PROGRAMMING/ INTERNET       LANGUAGES/ SCRIPTING     

MetaDirectory

Conferences  (10) People  (118) Publications  (3)

• 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.
• Average-Case Complexity Forum
  Introduction and survey papers.
• 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.
• A Compendium of NP Optimization Problems
  This is a preliminary version of the catalog of NP optimization problems.
• 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.
• Complexity Zoo
  Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.
• Computability and Complexity
  An online course on complexity.
• Computational Complexity and Programming Languages
  Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
• Computational Complexity Theory
  Definition of the subject, links.
• Computational Complexity Theory
  Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol
• Computational Complexity Theory
  Wikipedia article.
• 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 web resources.
• Efficient algorithms and intractable problems
  Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
• IBM Research: Algorithms & Theory
  An overview of computational models and methods and how they relate to complexity, with links to selected papers.
• Information-based Complexity
  People, publications, prizes.
• Lecture notes on Complexity
  Collection of lecture notes by Prof. Eric Allender, Rutgers University.
• $1 million for solving P vs NP
  One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
• 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.
• SAT Live!
  A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
• 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.
• 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.
• Theory of Computation, Fall 2006
  Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.

 

 

 

 

 

 

 

 

 

 

Help build the largest human-edited directory on the web. Submit a Site - Open Directory Project - Become an Editor

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 Link Tip
   Google Dance Tool
   Royalty Free Stock Photos
   Text Link Ads

 

 

 Partner Sites
   PHP Scripts
   Online Appointment Scheduling