My Orders
Wishlist
Help
Sell On Loot
Arthur-Merlin Protocol (Paperback)
High Quality Content by WIKIPEDIA articles! In computational complexity theory, an Arthur-Merlin protocol is an interactive proof system in which the verifier's coin tosses are constrained to be public (i.e. known to the prover too). This notion was introduced by Babai (1985). Goldwasser & Sipser (1986) proved that all languages with interactive proofs of arbitrary length with private coins also have interactive proofs with public coins.
R847
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
8470
@R79pm x 12* 
Out of stock
Add to wish listReview this Item
Product Description
High Quality Content by WIKIPEDIA articles! In computational complexity theory, an Arthur-Merlin protocol is an interactive proof system in which the verifier's coin tosses are constrained to be public (i.e. known to the prover too). This notion was introduced by Babai (1985). Goldwasser & Sipser (1986) proved that all languages with interactive proofs of arbitrary length with private coins also have interactive proofs with public coins.
Customer Reviews
No reviews or ratings yet - be the first to create one!
Product Details
General
Imprint | Alphascript Publishing |
Country of origin | United States |
Release date | August 2010 |
Availability | Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available. |
First published | August 2010 |
Editors | Frederic P. Miller, Agnes F. Vandome, John McBrewster |
Dimensions | 152 x 229 x 4mm (L x W x T) |
Format | Paperback - Trade |
Pages | 72 |
ISBN-13 | 978-6131866173 |
Barcode | 9786131866173 |
Categories | |
LSN | 6131866171 |
Similar Products | Recommended ProductsSee more 
Trending On Loot
Be the first to know about our
latest deals & promos! Subscribe Now
