Betascript Publishers

P Versus NP Problem

Name: P Versus NP Problem
Brand: Betascript Publishers
SKU: cae6673a903656e2603b470f4ada084a

1/1

Bol

Prijzen vanaf

30,64

Uitgelicht

	30,64	Naar shop
	30,64	Naar shop
	136,00	Naar shop
VERGELIJK ALLE AANBIEDERS (3)

Beschrijving

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

Lees meer

Vergelijk aanbieders (3)

Sorteren op:

€ 30,64 Gratis verzending

€ 136,00 Gratis verzending

Beschrijving (1)

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.

Lees meer