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

ZPP (Complexity): Polynomial Time, Turing Machine, Logarithmic Space -

English
2026-03-19
€207.26 €259.07

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In complexity theory, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always returns the correct YES or NO answer.; The running time is polynomial on average for any input. In other words, the algorithm is allowed to flip a truly-random coin while it is run ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In complexity theory, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always returns the correct YES or NO answer.; The running time is polynomial on average for any input. In other words, the algorithm is allowed to flip a truly-random coin while it is running. It always returns the correct answer. (Such an algorithm is called a Las Vegas algorithm.) For a problem of size n, there is some polynomial p(n) such that the average running time will be less than p(n), even though it might occasionally be much longer.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131175589
Write Your Own Review
You're reviewing: ZPP (Complexity): Polynomial Time, Turing Machine, Logarithmic Space
Your Rating:

Goodreads Reviews

€207.26 €259.07