Items related to EXPSPACE: EXPSPACE, Computational complexity theory,...

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

 
9786130701031: EXPSPACE: EXPSPACE, Computational complexity theory, Set (mathematics), Decision problem, Turing machine, Linear function, Savitch's theorem, NSPACE, DSPACE
Softcover
ISBN 10: 6130701039 ISBN 13: 9786130701031
Publisher: OmniScriptum, 2010

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.

"synopsis" may belong to another edition of this title.

Reseņa del editor

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.

"About this title" may belong to another edition of this title.

Publisher
OmniScriptum
Publication date
2010
Language
English
ISBN 10 
6130701039
ISBN 13 
9786130701031
Binding
Tapa blanda
Number of pages
84
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John