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

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

Sinossi

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."

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Betascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
613033558X
ISBN 13 
9786130335588
Rilegatura
Copertina flessibile
Numero di pagine
76
Redattore
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Contatto del produttore
non disponibile
Persona responsabile
non disponibile