Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
Sign Up to like & getrecommendations! Published in 2023 at "Algorithmica"
DOI: 10.4230/lipics.itcs.2022.3
Abstract: 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… read more here.
Keywords: time; merlin; arthur time; merlin arthur ... See more keywords