Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

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

angļu valoda
2026-03-19
146,96 € 244,94 €

-40% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786131175275
Rakstiet savu atsauksmi
Jūs vērtējat: ZPL (Complexity): Computational Complexity Theory, Logarithmic Space
Jūsu novērtējums:

Goodreads atsauksmes

146,96 € 244,94 €