On distributed Merlin-Arthur decision protocols

DOI10.1007/978-3-030-24922-9_16OpenAlexW2960251115MaRDI QIDQ2303292

Rotem Oshman, Pierre Fraigniaud, Ivan Rapaport, Ioan Todinca, Pedro Montealegre

Publication date: 3 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24922-9_16

zbMATH Keywords

nondeterminisminteractive proof systemsinteractive computationdistributed verification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Related Items (6)

Unnamed Item ⋮ A hierarchy of local decision ⋮ Deciding and verifying network properties locally with few output bits ⋮ Compact distributed certification of planar graphs ⋮ Distributed interactive proofs for the recognition of some geometric intersection graph classes ⋮ Local certification of graphs with bounded genus

This page was built for publication: On distributed Merlin-Arthur decision protocols