20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem -

English
2026-03-14
€133.57 €166.96

-20% with code BOOKS

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
You're reviewing: EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem
Your Rating:

Goodreads Reviews

€133.57 €166.96