EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem -
(0)
Write a review
-20%
Language
English
Cover
Softcover
Published
2026-03-14
€133.57
€166.96
-20% with code BOOKS
Softcover
€166.96
Hardcover
In stock at our supplier
Shipping in 15-21 days
30-day return policy
In computational complexity theory, the complexity class EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n.
You May Also Like
Description
In computational complexity theory, the complexity class EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n.
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786130702250 |
Write Your Own Review
Goodreads Reviews
€133.57
€166.96