Artículos relacionados a Arthur-Merlin protocol: Computational complexity theory,...

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

 
9786131866173: Arthur-Merlin protocol: Computational complexity theory, Interactive proof system, Random number generation, Complexity class, Decision problem, Polynomial hierarchy
Tapa blanda
ISBN 10: 6131866171 ISBN 13: 9786131866173
Editorial: OmniScriptum, 2010

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
OmniScriptum
Año de publicación
2010
Idioma
Inglés
ISBN 10 
6131866171
ISBN 13 
9786131866173
Encuadernación
Tapa blanda
Número de páginas
72
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John
Contacto del fabricante
no disponible
Persona responsable
no disponible