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

Complexity Science Theory - Computer Sciences Directory

• InformationBased Complexity
  
  Informationbased complexity IBC is the branch of computational complexity that studies problems for which the information is partial, contaminated, and priced. To motivate these assumptions about information consider the problem of the numerical comp ...
  http://www.ibc-research.org/

• The Complexity of Algorithms
  
  A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format. ...
  http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html

• Computability and Complexity
  
  Any binary string can be viewed as the representation of some natural number. Thus for decision problems on binary strings we can concentrate on the set of functions of the form ...
  http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html

• The Computational Complexity Theory
  
  Computational complexity theory is a branch of the theory of computation in computer science that investigates the problems related to the resources required to run algorithms, and the inherent difficulty in providing algorithms that are efficient fo ...
  http://en.wikipedia.org/wiki/Computational_complexity_theory

• Efficient algorithms
  
  Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley. ...
  http://www-inst.eecs.berkeley.edu/~cs170/fa06/

• The Automata Computability
  
  This year, MIT OpenCourseWare OCW celebrates its eighth anniversary. Our success to date would not have been possible without the thousands of donors and supporters who believe in our mission. Through their support, OCW has brought MITs educational m ...
  http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045...

• Constraint Satisfaction Problems Research group in the Computing Laboratory, Oxford University.
  
  Computational problems from many different application areas can be seen as constraint satisfaction problems. For example, the problems of scheduling a collection of tasks, or laying out a silicon chip, or interpreting a visual image, can all be seen ...
  http://www.comlab.ox.ac.uk/activities/constraints/

• Theory of Computation
  
  The goal of advancing education around the world is shared by the MIT Faculty. Indeed, we owe the existence of OpenCourseWare to the foresight, dedication, and generosity of our faculty. In the year 2000, a faculty committee first proposed this bold ...
  http://ocw.mit.edu/OcwWeb/Mathematics/18-404JFall-2006/CourseHome/

• The Complexity Theory
  
  The strive for efficiency is ancient and universal, as time and other resources are always in shortage. Thus, the question of which tasks can be performed efficiently is central to the human experience. A key step towards the systematic study of the ...
  http://www.wisdom.weizmann.ac.il/~oded/cc.html

• A Compendium
  
  This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation. The compendium has not been updated for a while, so there might exist recent resul ...
  http://www.nada.kth.se/~viggo/problemlist/compendium.html