20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

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

English
2026-03-22
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 "qui ... Full description

You May Also Like

Description

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786130335588
Write Your Own Review
You're reviewing: P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset
Your Rating:

Goodreads Reviews

€156.58 €195.73