On distributed merlin-arthur decision protocols

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

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

7 Citas (Scopus)


In a distributed locally-checkable proof, we are interested in checking the legality of a given network configuration with respect to some Boolean predicate. To do so, the network enlists the help of a prover—a computationally-unbounded oracle that aims at convincing the network that its state is legal, by providing the nodes with certificates that form a distributed proof of legality. The nodes then verify the proof by examining their certificate, their local neighborhood and the certificates of their neighbors. In this paper we examine the power of a randomized form of locally-checkable proof, called distributed Merlin-Arthur protocols, or dMA for short. In a dMA protocol, the prover assigns each node a short certificate, and the nodes then exchange random messages with their neighbors. We show that while there exist problems for which dMA protocols are more efficient than protocols that do not use randomness, for several natural problems, including Leader Election, Diameter, Symmetry, and Counting Distinct Elements, dMA protocols are no more efficient than standard nondeterministic protocols. This is in contrast with Arthur-Merlin (dMA) protocols and Randomized Proof Labeling Schemes (RPLS), which are known to provide improvements in certificate size, at least for some of the aforementioned properties.

Idioma originalInglés
Título de la publicación alojadaStructural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings
EditoresKeren Censor-Hillel, Michele Flammini
EditorialSpringer Verlag
Número de páginas16
ISBN (versión impresa)9783030249212
EstadoPublicada - 2019
Publicado de forma externa
Evento26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019 - L'Aquila, Italia
Duración: 1 jul. 20194 jul. 2019

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen11639 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349


Conferencia26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019


Profundice en los temas de investigación de 'On distributed merlin-arthur decision protocols'. En conjunto forman una huella única.

Citar esto