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ā

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

angļu valoda
2026-03-19
169,57 € 282,62 €

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

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786131175589
Rakstiet savu atsauksmi
Jūs vērtējat: ZPP (Complexity): Polynomial Time, Turing Machine, Logarithmic Space
Jūsu novērtējums:

Goodreads atsauksmes

169,57 € 282,62 €