Publisher
Springer Nature Switzerland
Reference58 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: FOCS, pp. 14–23 (1992)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. J. ACM 45(3), 501–555 (1998)
3. Arora, S., Safra, S.: Probabilistic checking of proofs; A new characterization of NP. In: FOCS, pp. 2–13 (1992)
4. Arora, S., Safra, S.: Probabilistic checkable proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998)
5. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: ICALP, pp. 14:1–14:17 (2018)