Merlin-arthur Protocols

Merlin-Arthur Protocols is a type of interactive proof system in computational complexity theory where a powerful but untrusted prover (Merlin) sends a single message to a probabilistic polynomial-time verifier (Arthur), who then decides whether to accept or reject based on that message and his own random coins.

43

Publications

3.1K

Citations

66

Authors

59

Institutions

Publications per year

2017–2026

3

Variants

Ma

Authors

66

  1. JT
    Justin Thaler

    Harvard University, United States

    3 publications · 43 citations

    3

    h-index

  2. AW
    Aram W. Harrow

    Massachusetts Institute of Technology, United States

    3 publications · 157 citations

    3

    h-index

  3. DG
    Dan Gutfreund

    Tel Aviv University, Israel

    3 publications · 87 citations

    3

    h-index

  4. AM
    Ashley Montanaro

    University of Bristol, United Kingdom

    3 publications · 157 citations

    3

    h-index

  5. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    2 publications · 39 citations

    2

    h-index

1–5 of 66

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 62 citations

    4

    h-index

  2. Computational Complexity

    CC · 4 publications · 345 citations

    4

    h-index

  3. Quantum Information and Computation

    QIC · 3 publications · 82 citations

    3

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 38 citations

    2

    h-index

  5. 2

    h-index

1–5