ZPL (Complexity): Computational Complexity Theory, Logarithmic Space -
-40% ar kodu BOOKS
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
Vairāk informācijas
| Izdevējs | OmniScriptum |
|---|---|
| Izlaides gads | 2026 |
| Vāka tips | Mīkstais vāks |
| EAN | 9786131175275 |