Home » Computer Sciences » Computer Science Theoretical » Complexity Science Theory

Complexity Science Theory - Computer Sciences Directory

• Probabilistically Checkable
  Background The NPcompleteness of important optimization problems focused research effort on the design of approximation algorithms. Some problems succumbed to approximation. Others, however defied all efforts to either find good approximation algorit ...
  http://www-cse.ucsd.edu/users/mihir/pcp.html

• Clay Mathematics Institute
  Suppose that you are organizing housing accommodations for a group of four hundred university students. Space is limited and only one hundred of the students will receive places in the dormitory. To complicate matters, the Dean has provided you with ...
  http://www.claymath.org/millennium/P_vs_NP/

• The Computational Complexity
  A fundamental area of theoretical computer science is complexity theory, the analysis of the resources needed to solve computational problems. Researchers in this area define computational models, such as Turing machines, Boolean Circuits, Parallel R ...
  http://www.cs.umass.edu/~immerman/complexity_theory.html

• The SATLIB
  A collection of benchmark problems, solvers, and tools. Provides a uniform testbed 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/

• The Theoretical Computer
  A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover. ...
  http://www.thi.uni-hannover.de/en/research/links/

• Lecture notes on Complexity
  There are two graduatelevel courses in complexity theory that I have taught here at Rutgers. Notes that were prepared for some of the material covered in those courses are available for your reading pleasure. Collection of lecture notes by Prof. Eric ...
  http://www.cs.rutgers.edu/~allender/lecture.notes/

• ECCC
  Electronic Colloquium on Computational Complexity located at the University of Trier, Germany ...
  http://eccc.hpi-web.de/

• The Challenging Benchmarks
  The Boolean Satisfiability Problem SAT is a core of NPcomplete problems and is central in the theory of computation. Finding challenging benchmarks for the satisfiability problem is not only of significance for the experimental evaluation of SAT algo ...
  http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm

• Computational Complexity
  The aim of the workshop was to bring together researchers in computational complexity and in programming languages to work toward deepening the interplay between the two areas. The workshop included a series of invited talks on a broad range of topic ...
  http://www.cis.syr.edu/people/royer/talks.html

• The NP Complete Arcade
  Had you solved this super fiendish puzzle, and posted your solution to The Times, you might have got yourself a bottle of bubbly. To earn that, you would have used a fair number of the deductive processes that youve developed over the last few years. ...
  http://hagaregn.org.uk/npsudoku/index.html