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ā

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

angļu valoda
2026-04-11
137,01 € 195,73 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas 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 ... Pilns apraksts

Jums varētu patikt arī

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.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786133672420
Rakstiet savu atsauksmi
Jūs vērtējat: Probabilistically Checkable Proof: Computational Complexity Theory, Certificate, Randomized Algorithm
Jūsu novērtējums:

Goodreads atsauksmes

137,01 € 195,73 €