Arthur–Merlin protocol: Computational complexity theory, Interactive proof system, Random number generation, Complexity class, Decision problem, Polynomial hierarchy - Couverture souple

 
9786131866173: Arthur–Merlin protocol: Computational complexity theory, Interactive proof system, Random number generation, Complexity class, Decision problem, Polynomial hierarchy
Couverture souple
ISBN 10 : 6131866171 ISBN 13 : 9786131866173
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6131866171
ISBN 13 
9786131866173
Reliure
Broché
Nombre de pages
72
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible