Articoli correlati a Arthur–Merlin protocol: Computational complexity...

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

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

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Alphascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
6131866171
ISBN 13 
9786131866173
Rilegatura
Copertina flessibile
Numero di pagine
72
Redattore
Miller Frederic P., Vandome Agnes F., McBrewster John
Contatto del produttore
non disponibile
Persona responsabile
non disponibile