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 gu...
This page was last updated on July 16th, 2008
This page was last updated on July 16th, 2008
Complexity Theory (from Theoretical)
Canadian Content » Computers » Computer_Science » Theoretical » Complexity_Theory »
Computational Complexity and Programming Languages
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
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.
Algorithms and Complexity Research Area
The Oxford University Computing Laboratory's area on Algorithms and complexity, with links to lectures and information.
SAT Live!
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
Computability and Complexity
An online course on complexity.
Probabilistically Checkable Proofs and Approximation
Pointers to some survey articles and their authors, by M. Bellare.
Average-Case Complexity Forum
Introduction and survey papers.
Complexity Theory
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
Stas Busygin's NP-Completeness Page
A proposal for solving NP-hard problems.
Lecture notes on Complexity
Collection of lecture notes by Prof. Eric Allender, Rutgers 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.
P vs NP
Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
Roberto Bayardo's Resources
Includes the relsat SAT solver and related papers.
Constraint Satisfaction Problems
Research group in the Computing Laboratory, Oxford University.
A Compendium of NP Optimization Problems
This is a preliminary version of the catalog of NP optimization problems.
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.
Complexity of Algorithms
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
Computational Complexity Theory
Wikipedia article.
Algorithms and Complexity
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Parameterized Complexity
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
Information-based Complexity
People, publications, prizes.
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
The Oxford University Computing Laboratory's area on Algorithms and complexity, with links to lectures and information.
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
An online course on complexity.
Pointers to some survey articles and their authors, by M. Bellare.
Introduction and survey papers.
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
A proposal for solving NP-hard problems.
Collection of lecture notes by Prof. Eric Allender, Rutgers 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.
Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
Includes the relsat SAT solver and related papers.
Research group in the Computing Laboratory, Oxford University.
This is a preliminary version of the catalog of NP optimization problems.
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.
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
Wikipedia article.
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
People, publications, prizes.
Theoretical >> Complexity Theory yielded other results on Canadian Content:
Why Believe In God?
Why Believe In God? Christian Discussion
Why Believe In God? Christian Discussion
Evolution Debate ...
April 13th, 2005, 11:24 PM "If it could be demonstrated that any complex organ existed whi
April 13th, 2005, 11:24 PM "If it could be demonstrated that any complex organ existed whi
Breaking News-Humans `not to blame` for climate change
Humans 'not to blame' for climate change April 3, 2007 - 8:04AM A group of scientists is fighting a
Humans 'not to blame' for climate change April 3, 2007 - 8:04AM A group of scientists is fighting a
Paradox of Nothingness
April 30th, 2007, 01:09 AM If the world is fundamentally logical then it must have a logical reason
April 30th, 2007, 01:09 AM If the world is fundamentally logical then it must have a logical reason
Why The 9/11 Conspiracies Won`t Go Away
Why The 9/11 Conspiracies Won't Go Away US-American Politics
Why The 9/11 Conspiracies Won't Go Away US-American Politics
|
 |
-
