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..]]'''Computational complexity''' is a branch of theoretical computer science which attempts to explain why certain computational problems are intractable for computers. | [[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 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. | ||
== | == In the News == | ||
<gallery mode="traditional"> | <gallery mode="traditional"> | ||
File:Hypercube.svg|link=The Boxes|[[The Boxes]], while not measurable, are assumed to have extremely high computations complexity. | File:Hypercube.svg|link=The Boxes|[[The Boxes]], while not measurable, are assumed to have extremely high computations complexity. | ||
</gallery> | </gallery> | ||
== Fiction cross-reference == | |||
* [[Gnomon algorithm]] | * [[Gnomon algorithm]] | ||
| Line 14: | Line 16: | ||
== Nonfiction cross-reference == | == Nonfiction cross-reference == | ||
* [[Algorithm (nonfiction)]] | |||
* [[Complexity (nonfiction)]] | |||
* [[Computation (nonfiction)]] | * [[Computation (nonfiction)]] | ||
* [[Mathematics (nonfiction)]] | |||
External links: | |||
* [http://wiki.karljones.com/index.php?title=Computational_complexity Computational complexity ] @ wiki.karljones.com | * [http://wiki.karljones.com/index.php?title=Computational_complexity Computational complexity ] @ wiki.karljones.com | ||
Revision as of 17:34, 23 June 2016
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
External links:
- Computational complexity @ wiki.karljones.com
- Computational complexity @ Wikipedia