EXPSPACE: EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitch's theorem, NSPACE, DSPACE - Brossura

 
9786130701031: EXPSPACE: EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitch's theorem, NSPACE, DSPACE

Sinossi

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's theorem.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.