Complexity Class: Computational complexity theory, Computational problem, Abstract machine, Big O notation, NP (complexity), Decision problem, ... machine, Function problem, FP (complexity) - Softcover

 
9786130694197: Complexity Class: Computational complexity theory, Computational problem, Abstract machine, Big O notation, NP (complexity), Decision problem, ... machine, Function problem, FP (complexity)
Softcover
ISBN 10: 6130694199 ISBN 13: 9786130694197
Publisher: Alphascript Publishing, 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, a complexity class is a set of problems of related complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by abstract machine M using O(f(n)) of resource R (n is the size of the input). For example, the class NP is the set of decision problems that can be solved by a non-deterministic Turing machine in polynomial time, while the class PSPACE is the set of decision problems that can be solved by a deterministic Turing machine in polynomial space. Some complexity classes are sets of function problems, such as FP. Many complexity classes can be characterized in terms of the mathematical logic needed to express them; see descriptive complexity. The Blum axioms can be used to define complexity classes without referring to a concrete computational model.

"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, a complexity class is a set of problems of related complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by abstract machine M using O(f(n)) of resource R (n is the size of the input). For example, the class NP is the set of decision problems that can be solved by a non-deterministic Turing machine in polynomial time, while the class PSPACE is the set of decision problems that can be solved by a deterministic Turing machine in polynomial space. Some complexity classes are sets of function problems, such as FP. Many complexity classes can be characterized in terms of the mathematical logic needed to express them; see descriptive complexity. The Blum axioms can be used to define complexity classes without referring to a concrete computational model.

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

Publisher
Alphascript Publishing
Publication date
2010
Language
English
ISBN 10 
6130694199
ISBN 13 
9786130694197
Binding
Tapa blanda
Number of pages
92
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John