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

ZPL (Complexity): Computational Complexity Theory, Logarithmic Space -

English
2026-03-19
€179.62 €224.53

-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, ZPL (Zero-error Probabilistic Logarithmic space) is the set of problems solvable by a probabilistic Turing machine which always yields the correct answer and uses logarithmic space on average. Probabilistic algorithms that always give the correct answer are called Las Vegas algorithms. Unlike its deterministic counterpart L, a ZPL machine can ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In complexity theory, ZPL (Zero-error Probabilistic Logarithmic space) is the set of problems solvable by a probabilistic Turing machine which always yields the correct answer and uses logarithmic space on average. Probabilistic algorithms that always give the correct answer are called Las Vegas algorithms. Unlike its deterministic counterpart L, a ZPL machine can potentially use exponential time by exploiting randomness. If ZPL is restricted to polynomial time, we get the more interesting class ZPLP. A surprising result is that ZPL is equal to both RL and NL; thus, if a problem can be solved in logarithmic space with nondeterminism or with one-sided error, it can be solved with no error and logarithmic space on average. See the articles on RL and NL for more information about ZPL.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131175275
Write Your Own Review
You're reviewing: ZPL (Complexity): Computational Complexity Theory, Logarithmic Space
Your Rating:

Goodreads Reviews

€179.62 €224.53