Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2026-03-14
100,18 € 166,96 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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.

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786130702250
Kirjuta oma arvustus
Te vaatate: EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem
Teie hinnang:

Goodreads'i arvustused

100,18 € 166,96 €