Non-interactive proofs of proximity-Reference-Cited by-同舟云学术

Non-interactive proofs of proximity

Published:2016-06-03 Issue:1 Volume:27 Page:99-207
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Gur Tom,Rothblum Ron D.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00037-016-0136-9/fulltext.html

Reference76 articles.

1. Scott Aaronson & Avi Wigderson (2009). Algebrization: A New Barrier in Complexity Theory. ACM Trans. Comput. Theory 1, 2:1–2:54. ISSN 1942-3454. URL http://doi.acm.org/10.1145/1490270.1490272 .

2. Noga Alon, Eldar Fischer, Ilan Newman & Asaf Shapira (2006). A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM Journal on Computing 39(1), 143–167.

3. Alon Noga, Krivelevich Michael, Newman Ilan, Szegedy Mario (2000) Regular Languages are Testable with a Constant Number of Queries. SIAM J. Comput. 30(6): 1842–1862

4. Arora Sanjeev, Sudan Madhu (2003) Improved Low-Degree Testing and its Applications. Combinatorica 23(3): 365–426

5. László Babai (1985). Trading group theory for randomness. In Proceedings of the seventeenth annual ACM symposium on Theory of computing, 421–429. ACM.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Local Proofs Approaching the Witness Length;Journal of the ACM;2024-06-11

2. A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification;SIAM Journal on Computing;2023-12-06

3. Doubley-Efficient Interactive Proofs for Distribution Properties;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity;SIAM Journal on Computing;2022-12-16

5. Quantum Proofs of Proximity;Quantum;2022-10-13