EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, ... hierarchy theorem, Space hierarchy theorem - Softcover

 
9786130702250: EXPTIME: EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, ... hierarchy theorem, Space hierarchy theorem
Softcover
ISBN 10: 6130702256 ISBN 13: 9786130702250
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 computational complexity theory, the complexity class EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n.

"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 computational complexity theory, the complexity class EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n.

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

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