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

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

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6131866171
ISBN 13 
9786131866173
Einband
Tapa blanda
Anzahl der Seiten
72
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar