P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset - Couverture souple

 
9786130335588: P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset
Couverture souple
ISBN 10 : 613033558X ISBN 13 : 9786130335588
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field. In essence, the question P = NP? asks: if ''yes''-answers to a ''yes''-or-''no''-question can be verified quickly", can the answers themselves also be computed quickly? An answer to the P = NP question would determine whether problems like the subset-sum problem are as "easy" to compute as to verify. If it turned out P does not equal NP, it would mean that some NP problems are substantially "harder" to compute than to verify."

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

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
613033558X
ISBN 13 
9786130335588
Reliure
Broché
Nombre de pages
76
Éditeur
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible