P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset - Tapa blanda
Sinopsis
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."
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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."
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para P Versus NP Problem: Complexity Class, Theoretical...
Imagen del vendedor
P Versus NP Problem
Publicado por
Heel Verlag Gmbh Okt 2000, 2000
ISBN 10: 613033558X
ISBN 13: 9786130335588
Nuevo
sonst. Bücher
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
sonst. Bücher. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! 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. 76 pp. Englisch. Nº de ref. del artículo: 9786130335588
Comprar nuevo
EUR 34,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
P Versus NP Problem : Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! 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. Nº de ref. del artículo: 9786130335588
Comprar nuevo
EUR 35,89
Envío por EUR 60,66
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
P Versus NP Problem | Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. P Versus NP Problem | Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130335588 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 101385119
Comprar nuevo
EUR 109,85
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles