Computers, Computer Science, Theoretical, Complexity Theory
- Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
- People, publications, prizes.
- A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
- 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 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.
- Collection of lecture notes by Prof. Eric Allender, Rutgers University.
- Definition of the subject, links.
- Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
- An overview of computational models and methods and how they relate to complexity, with links to selected papers.
- Pointers to some survey articles and their authors, by M. Bellare.
- 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.
- An online course on complexity.
- A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
- A proposal for solving NP-hard problems.
- Research group in the Computing Laboratory, Oxford University.
- This is a preliminary version of the catalog of NP optimization problems.
- Brief description, list of workers and problem compendium, compiled by Todd Wareham.
- Includes the relsat SAT solver and related papers.
- Introduction and survey papers.
|
|
|
