Idioma: Inglés
Publicado por Alphascript Publishing, 2010
ISBN 10: 6130701039 ISBN 13: 9786130701031
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 34,00
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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's theorem. 84 pp. Englisch.
Librería: preigu, Osnabrück, Alemania
EUR 94,40
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. EXPTIME | EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130702250 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Librería: preigu, Osnabrück, Alemania
EUR 109,85
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. EXPSPACE | EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitch's theorem, NSPACE, DSPACE | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130701031 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.