Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols - van Melkebeek, Dieter; Mocelin Sdroievski, Nicollas (Computational complexity, 2025)
Keywords: Algorithm Analysis and Problem Complexity; Algorithms; Byproducts; Computational Mathematics and Numerical Analysis; Computer Science; Equivalence; Hardness; Lower bounds; Polynomials; Pseudorandom; Surface hardness; 68Q15; targeted hitting-set generator; derandomization; Instance-wise hardness versus randomness; Arthur–Merlin protocol