Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols.

Dieter van Melkebeek Nicollas M. Sdroievski

Published in: CCC (2023)

Keyphrases

design decisions
pairwise
genetic algorithm
computational complexity
phase transition
np hard
real time
information theoretic
authentication protocol
communication protocol
acyclic conjunctive queries
database
neural network
information retrieval
case study
communication protocols