Computational complexity (nonfiction): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[File:Complexity_subsets_pspace.svg|thumb|200px|A representation of the relation among complexity classes, which are subsets of each other | [[File:Complexity_subsets_pspace.svg|thumb|200px|A representation of the relation among complexity classes, which are subsets of each other.]]'''Computational complexity''' is a branch of theoretical computer science which attempts to explain why certain computational problems are intractable for computers. | ||
Analysis of [[Algorithm (nonfiction)|algorithms]] is a complementary branch which studies methods of solving computational problems efficiently. | Analysis of [[Algorithm (nonfiction)|algorithms]] is a complementary branch which studies methods of solving computational problems efficiently. | ||
Revision as of 13:00, 1 September 2018
Computational complexity is a branch of theoretical computer science which attempts to explain why certain computational problems are intractable for computers.
Analysis of algorithms is a complementary branch which studies methods of solving computational problems efficiently.
In the News
The Boxes, while not measurable, are assumed to have extremely high computations complexity.
Fiction cross-reference
Nonfiction cross-reference
- Algorithm (nonfiction)
- Complexity (nonfiction)
- Computation (nonfiction)
- Mathematics (nonfiction)
- Polynomial hierarchy (nonfiction) - a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines. It is a resource-bounded counterpart to the arithmetical hierarchy and analytical hierarchy from mathematical logic.
External links:
- Computational complexity @ wiki.karljones.com
- Computational complexity @ Wikipedia