Computational complexity (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "thumb|200px|Computational complexity model.'''Computational complexity''' is a branch of theoretical computer science which attempts to...") |
No edit summary |
||
| Line 1: | Line 1: | ||
[[File:Complexity_subsets_pspace.svg|thumb|200px| | [[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 algorithms is a complementary branch which studies methods of solving computational problems efficiently. | ||
Revision as of 11:46, 12 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.
Fiction cross-reference
Nonfiction cross-reference
External links
- Computational complexity @ wiki.karljones.com
- Computational complexity @ Wikipedia