Directory: Top/Computers/Computer_Science/Theoretical/Complexity

Top / Computers / Computer_Science / Theoretical / Complexity_Theory /

$1 million for solving P vs NP
One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
http://www.claymath.org/millennium/P_vs_NP/
Claymath.org ~ Site Info Whois Trace Route RBL Check

Complexity Theory
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
http://www.wisdom.weizmann.ac.il/~oded/cc.html
Weizmann.ac.il ~ Site Info Whois Trace Route RBL Check

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.
http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm
Buaa.edu.cn ~ Site Info Whois Trace Route RBL Check

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.
http://www.satlib.org/
Satlib.org ~ Site Info Whois Trace Route RBL Check

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.
http://eccc.hpi-web.de/
Hpi-web.de ~ Site Info Whois Trace Route RBL Check

Lecture notes on Complexity
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
http://www.cs.rutgers.edu/~allender/lecture.notes/
Rutgers.edu ~ Site Info Whois Trace Route RBL Check

IBM Research: Algorithms & Theory
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
http://domino.research.ibm.com/comm/research.nsf/pages/r.algorithms.html
Ibm.com ~ Site Info Whois Trace Route RBL Check

Efficient algorithms and intractable problems
Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
http://www-inst.eecs.berkeley.edu/~cs170/fa06/
Berkeley.edu ~ Site Info Whois Trace Route RBL Check

Theory of Computation, Fall 2006
Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.
http://ocw.mit.edu/OcwWeb/Mathematics/18-404JFall-2006/CourseHome/
Mit.edu ~ Site Info Whois Trace Route RBL Check

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.
http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JSpring-2005/CourseHome/index.htm
Mit.edu ~ Site Info Whois Trace Route RBL Check