EXPSPACE: EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitchs theorem, NSPACE, DSPACE -
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.In complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a polynomial function of n. If we use a nondeterministic machine instead, we get the class NEXPSPACE, which is equal to EXPSPACE by Savitch' ... Full description
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786130701031 |