Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Arthur–Merlin protocol · Vinony

EntityQ4800823· pop 6· linked from 92 articles

Arthur–Merlin protocol

Sign in to save

interactive proof system in computational complexity theory

Connections

International Standard Book Number

digital object identifier

International Standard Serial Number

formal language

Cambridge University Press

Shafrira Goldwasser

computational complexity theory

decision problem

zero-knowledge proof

regular language

complexity class

random number generation

Categories

Randomized algorithms

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Sparse language

Entitydist 0.47

computation tree logic

Entitydist 0.47

Computational complexity of mathematical operations

Entitydist 0.50

pseudo-polynomial time

Entitydist 0.53

Davis–Putnam algorithm

Entitydist 0.53

satisfiability modulo theories

Entitydist 0.53

Secure multi-party computation

Entitydist 0.55

computable function

Entitydist 0.56

counter machine

Entitydist 0.56

quantum computing

Entitydist 0.56

Entitydist 0.57

cryptographic primitive

Entitydist 0.57

What links here92 pages

complexity class

interactive proof system

computational complexity theory

probabilistically checkable proof

true quantified Boolean formula

P versus NP problem

Grzegorczyk hierarchy

regular language

computable function

time complexity