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

Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity -

English
2026-03-22
€207.26 €259.07

-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. In computer science, polynomial time refers to the running time of an algorithm, that is, the number of computation steps a computer or an abstract machine requires to evaluate the algorithm. An algorithm is said to be polynomial time if its running time is upper bounded by a polyn ... 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. In computer science, polynomial time refers to the running time of an algorithm, that is, the number of computation steps a computer or an abstract machine requires to evaluate the algorithm. An algorithm is said to be polynomial time if its running time is upper bounded by a polynomial in the size of the input for the algorithm. Problems for which a polynomial time algorithm exists belong to the complexity class PTIME, which is central in the field of computational complexity theory. Cobham's thesis states that polynomial time is a synonym for "tractable", "feasible", "efficient", or "fast".

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786130338329
Write Your Own Review
You're reviewing: Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity
Your Rating:

Goodreads Reviews

€207.26 €259.07