Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2026-04-11
137,01 € 195,73 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786133672420
Kirjuta oma arvustus
Te vaatate: Probabilistically Checkable Proof: Computational Complexity Theory, Certificate, Randomized Algorithm
Teie hinnang:

Goodreads'i arvustused

137,01 € 195,73 €