File:Complexity subsets pspace.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 485 × 441 pixels. Other resolution: 2,252 × 2,048 pixels.
Original file (SVG file, nominally 485 × 441 pixels, file size: 17 KB)
Nonfiction: A representation of the relation among complexity classes, which are subsets of each other.
See Computational complexity (nonfiction).
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)
- Computational complexity (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
Attribution: By Hand drawn in Inkscape Qef - Own work by uploader, intended to replace bitmap image illustrating same thing, Public Domain, https://commons.wikimedia.org/w/index.php?curid=4353102
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 12:43, 12 June 2016 | | 485 × 441 (17 KB) | Admin (talk | contribs) |
You cannot overwrite this file.
File usage
The following 2 pages use this file:
