EXPSPACE: EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitchs theorem, NSPACE, DSPACE -
-40% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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' ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
Lisateave
| Kirjastaja | OmniScriptum |
|---|---|
| Väljalaskeaasta | 2026 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9786130701031 |