Login / Signup
Instance-Wise Hardness versus Randomness Tradeoffs for Arthur-Merlin Protocols.
Nicollas M. Sdroievski
Dieter van Melkebeek
Published in:
Electron. Colloquium Comput. Complex. (2023)
Keyphrases
</>
pairwise
worst case
design decisions
real time
computational complexity
np hard
acyclic conjunctive queries
np complete
learning theory
boolean formulae
phase transition
security protocols