Gourt > Computers > Computer Science > Theoretical > Complexity Theory (5)
Complexity theory may refer to:
- the study of any complex system
- chaos theory
- Computational complexity theory, a field in theoretical computer science and mathematics dealing with the resources required during computation to solve a given problem
- the theoretical treatment of Kolmogorov complexity of a string studied in algorithmic information theory by identifying the length of the shortest binary program which can output that string
- the application of complexity theory to organizations, which has been influential in strategic management and organizational studies; this area is sometimes referred to as complexity strategy or the study of complex adaptive organizations.
See also
- Systems theory (or systemics or general systems theory), an interdisciplinary field including engineering, biology, and philosophy that incorporates science to study large systems
Interesting theory about Apple (http://bit.ly/54P9Ra) but where's the evidence that they can run services of this scale/complexity?
randyholloway (Randy Holloway) Tue, 22 Dec 2009 03:31:21 -0000
Interesting theory about Apple (http://bit.ly/54P9Ra) but where's the evidence that they can run services of this scale/complexity?
@VenessaMiemis ...similar to string theory, the complexity of cog&physical space become manifest in the presence of "intent to act" Useful?
ToughLoveforX (Michael Josefowicz) Tue, 22 Dec 2009 03:00:37 -0000
@VenessaMiemis ...similar to string theory, the complexity of cog&physical space become manifest in the presence of "intent to act" Useful?
Subscribe to Complexity_Theory RSS feed
A Compendium of NP Optimization Problems - This is a preliminary version of the catalog of NP optimization problems.
Meta Description: [ A compendium of NP optimization problems ]
404
Algorithms and Complexity - A collection of bookmarks by Heribert Vollmer.
Algorithms and Complexity - An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Meta Description: [ IBM Almaden Research Center | DESCRIPTION ]
Algorithms and Complexity Research Area - The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.
Average-Case Complexity Forum - Introduction and survey papers.
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.
Meta Description: [ Forced Satisfiable CSP and SAT Benchmarks of Model RB ]
Complexity of Algorithms - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
Complexity Theory - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
Computability and Complexity - An online course on complexity.
Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
Computational Complexity Theory - Wikipedia article.
Computational Complexity Theory - Definition of the subject, links.
Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.
Meta Description: [ Oxford University Constraint Satisfaction Research Group ]
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.
Meta Description: [ Homepage of the Electronic Colloquium on Computational Complexity located at the University of Trier, Germany ]
Information-based Complexity - People, publications, prizes.
Lecture notes on Complexity - Collection of lecture notes by Prof. Eric Allender, Rutgers University.
P vs NP - Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
Parameterized Complexity - Brief description, list of workers and problem compendium, compiled by Todd Wareham.
Probabilistically Checkable Proofs and Approximation - Pointers to some survey articles and their authors, by M. Bellare.
404
Roberto Bayardo's Resources - Includes the relsat SAT solver and related papers.
Meta Description: [ IBM Research main home page ]
SAT Live! - A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
404
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.
Stas Busygin's NP-Completeness Page - A proposal for solving NP-hard problems.
| Advice is a concept in complexity theory. An advice string is an extra input to a Turing machine which is allowed to depend on the length n of the input, but not on input itself. A decision problem is in the complexity class P/f(n) if there is a polynomial time Turing machine M with the following property: for any n, there is an advice string A of length f(n) such that, for any input x of length n, the machine M correctly decides the problem on the input x, given x and A. (more) |
