Serebella
Description
Top
:
Computers
:
Computer Science
:
Theoretical
:
Complexity Theory
(142)
Open Directory - Computers: Computer Science: Theoretical: Complexity Theory
Conferences
(10)
People
(107)
Publications
(3)
$1 million for solving P vs NP
- One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
A Compendium of NP Optimization Problems
- This is a preliminary version of the catalog of NP optimization problems.
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 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.
Complexity of Algorithms
- A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
Computability and Complexity
- An online course on complexity.
Computational Complexity Theory
- Wikipedia article.
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 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 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.
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.
The NP-Complete Arcade
- Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard.
"
Complexity Theory
" search on:
AOL
-
Ask
-
Bing
-
Gigablast
-
Google
-
Lycos
-
Yahoo
-
Yippy
Copyright © 2012 Netscape
Terms of Use
Visit our sister sites
mozilla.org
|
MusicMoz
|
Wikipedia
Last update: Sunday, April 19, 2009 8:32:15 PM EDT -
edit
