Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2026-03-19
134,72 € 224,53 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786131175275
Kirjuta oma arvustus
Te vaatate: ZPL (Complexity): Computational Complexity Theory, Logarithmic Space
Teie hinnang:

Goodreads'i arvustused

134,72 € 224,53 €