Worst-Case to Average Case Reductions for the Distance to a Code
暂无分享,去创建一个
Eli Ben-Sasson | Shubhangi Saraf | Swastik Kopparty | Swastik Kopparty | Shubhangi Saraf | Eli Ben-Sasson
[1] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[2] Gábor Tardos,et al. On the Knowledge Complexity of , 2002, Comb..
[3] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[4] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[5] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[6] Eli Ben-Sasson,et al. Interactive Oracle Proofs , 2016, TCC.
[7] D. Boneh,et al. Interactive proofs of proximity: delegating computation in sublinear time , 2013, STOC '13.
[8] Madhu Sudan,et al. Small PCPs with Low Query Complexity , 2001, STACS.
[9] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[10] Eli Ben-Sasson,et al. Scalable, transparent, and post-quantum secure computational integrity , 2018, IACR Cryptol. ePrint Arch..
[11] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[12] Eli Ben-Sasson,et al. Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs , 2016, TCC.
[13] Eli Ben-Sasson,et al. Fast Reed-Solomon Interactive Oracle Proofs of Proximity , 2017, Electron. Colloquium Comput. Complex..
[14] Eli Ben-Sasson,et al. On Probabilistic Checking in Perfect Zero Knowledge , 2016, IACR Cryptol. ePrint Arch..
[15] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[16] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[17] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[18] Igor Shinkar,et al. On Axis-Parallel Tests for Tensor Product Codes , 2020, APPROX-RANDOM.
[19] Yuval Ishai,et al. Ligero: Lightweight Sublinear Arguments Without a Trusted Setup , 2017, Designs, Codes and Cryptography.
[20] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[21] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..