|
PR: 8
| 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. - Read more http://ocw.mit.edu |
|
PR: 8
| Computational Complexity Theory Wikipedia article. - Read more http://en.wikipedia.org |
|
PR: 7
| A Compendium of NP Optimization Problems This is a preliminary version of the catalog of NP optimization problems. - Read more http://www.nada.kth.se |
|
PR: 7
| Complexity Theory Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute. - Read more http://www.wisdom.weizmann.ac.il |
|
PR: 7
| Constraint Satisfaction Problems Research group in the Computing Laboratory, Oxford University. - Read more http://www.comlab.ox.ac.uk |
|
PR: 7
| $1 million for solving P vs NP One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI). - Read more http://www.claymath.org |
|
PR: 7
| Probabilistically Checkable Proofs and Approximation Pointers to some survey articles and their authors, by M. Bellare. - Read more http://www-cse.ucsd.edu |
|
PR: 6
| Computability and Complexity An online course on complexity. - Read more http://www.csc.liv.ac.uk |
|
PR: 6
| Computational Complexity Theory Definition of the subject, links. - Read more http://www.cs.umass.edu |
|
PR: 6
| Computational Complexity Theory Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol - Read more http://www.cs.bris.ac.uk |
|
PR: 6
| Lecture notes on Complexity Collection of lecture notes by Prof. Eric Allender, Rutgers University. - Read more http://www.cs.rutgers.edu |
|
PR: 6
| SAT Live! A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well. - Read more http://www.satlive.org |
|
PR: 6
| 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. - Read more http://www.satlib.org |
|
PR: 5
| 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. - Read more http://www.nlsde.buaa.edu.cn |
|
PR: 5
| Complexity of Algorithms A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format. - Read more http://artemis.cs.yale.edu |
|
PR: 5
| 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. - Read more http://eccc.hpi-web.de |
|
PR: 5
| Efficient algorithms and intractable problems Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley. - Read more http://www-inst.eecs.berkeley.edu |
|
PR: 5
| Information-based Complexity People, publications, prizes. - Read more http://www.ibc-research.org |
|
PR: 5
| Parameterized Complexity Brief description, list of workers and problem compendium, compiled by Todd Wareham. - Read more http://www.cs.mun.ca |
|
PR: 4
| Complexity Zoo Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project. - Read more http://qwiki.stanford.edu |
Online Shopping Cart Development with PayPal Integration @ $600. Only
NEED A WEBSITE DESIGN?
5 pages website design with logo design and homepage flash intro @ $125. Only