Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Malvika Raj"'
Publikováno v:
Algorithmica.
In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78ee25e22487115d13978b5b0ed935e2
https://doi.org/10.1007/s00453-023-01102-6
https://doi.org/10.1007/s00453-023-01102-6
