Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Probabilistically Checkable Proof: Computational Complexity Theory, Certificate, Randomized Algorithm -

Anglų
2026-04-11
146,80 € 195,73 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 15-21 d.d.

30 dienų grąžinimo politika

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct pr ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way. Probabilistically checkable proofs give rise to many complexity classes depending on the number of queries required and the amount of randomness used.

Daugiau informacijos

Leidėjas OmniScriptum
Išleidimo metai 2026
Viršelio tipas Minkšti viršeliai
EAN 9786133672420
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Probabilistically Checkable Proof: Computational Complexity Theory, Certificate, Randomized Algorithm
Jūsų įvertinimas:

Goodreads Atsiliepimai

146,80 € 195,73 €