Advice (complexity): Computational complexity theory, Turing machine, Decision problem, Complexity class, Boolean circuit, Nondeterministic algorithm - Couverture souple

 
9786132856326: Advice (complexity): Computational complexity theory, Turing machine, Decision problem, Complexity class, Boolean circuit, Nondeterministic algorithm
Couverture souple
ISBN 10 : 6132856323 ISBN 13 : 9786132856326
Editeur : 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, an advice string is an extra input to a Turing machine which is allowed to depend on the length n of the input, but not on input itself. A decision problem is in the complexity class P/f(n) if there is a polynomial time Turing machine M with the following property: for any n, there is an advice string A of length f(n) such that, for any input x of length n, the machine M correctly decides the problem on the input x, given x and A.

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

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6132856323
ISBN 13 
9786132856326
Reliure
Broché
Nombre de pages
72
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible