EXPSPACE - Couverture souple

 
9786130701031: EXPSPACE

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.