Interactive proofs of proximity: delegating computation in sublinear time
暂无分享,去创建一个
[1] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] Silvio Micali,et al. CS proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[3] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[4] Dana Ron,et al. Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..
[5] Louay Bazzi,et al. Polylogarithmic Independence Can Fool DNF Formulas , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Silvio Micali,et al. CS Proofs (Extended Abstracts) , 1994, FOCS 1994.
[7] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.
[8] Or Meir,et al. IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..
[9] Michael Alekhnovich,et al. Pseudorandom generators in propositional proof complexity , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[10] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[11] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[12] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[13] Oded Goldreich,et al. Introduction to Testing Graph Properties , 2010, Property Testing.
[14] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[15] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[16] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[17] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[18] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[19] Dan Suciu,et al. Journal of the ACM , 2006 .
[20] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[21] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[22] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[23] Oded Goldreich,et al. Hierarchy Theorems for Property Testing , 2011, computational complexity.
[24] Ronitt Rubinfeld,et al. Fast approximate probabilistically checkable proofs , 2004, Inf. Comput..
[25] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[26] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[27] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[28] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[29] Avi Wigderson,et al. On interactive proofs with a laconic prover , 2001, computational complexity.