Fast approximate probabilistically checkable proofs
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] Lance Fortnow,et al. On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..
[3] Mario Szegedy,et al. Many-Valued Logics and Holographic Proofs , 1999, ICALP.
[4] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[5] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[6] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[7] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[8] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..
[9] Silvio Micali,et al. CS proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[10] Joe Kilian,et al. Improved Efficient Arguments (Preliminary Version) , 1995, CRYPTO.
[11] M. Sudan,et al. Robust Characterizations of Polynomials and Their Applications to Program Testing , 1993 .
[12] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[13] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[14] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[15] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[16] Ran Canetti,et al. Lower Bounds for Sampling Algorithms for Estimating the Average , 1995, Inf. Process. Lett..
[17] Carsten Lund,et al. Interactive Proof Systems and Alternating Time-Space Complexity , 1991, Theor. Comput. Sci..
[18] L. Fortnow. Complexity-Theoretic Aspects of Interactive Proof Systems , 1989 .
[19] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[20] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[21] Richard M. Karp,et al. An Optimal Algorithm for Monte Carlo Estimation , 2000, SIAM J. Comput..
[22] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.
[23] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[24] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..
[25] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[26] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[27] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[28] Richard J. Lipton,et al. Towards uncheatable benchmarks , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[29] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[30] Cynthia Dwork,et al. Finite state verifiers I: the power of interaction , 1992, JACM.
[31] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[32] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[33] Carsten Lund,et al. Interactive Proof Systems and Alternating Time-Space Complexity , 1991, STACS.
[34] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..
[35] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[36] Oded Goldreich,et al. On Completeness and Soundness in Interactive Proof Systems , 1989, Adv. Comput. Res..
[37] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[38] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[39] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[40] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[41] Anne Condon. Space-bounded probabilistic game automata , 1991, JACM.
[42] Luca Trevisan,et al. Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[43] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[44] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[45] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.