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).
More information
More information
Subcategories 3
Sites 9
This is a preliminary version of the catalog of NP optimization problems.
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
An online course on complexity.
Wikipedia article.
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.
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
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.
Research group in the Computing Laboratory, Oxford University.
Wikipedia article.
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
An online course on complexity.
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
This is a preliminary version of the catalog of NP optimization problems.
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
