Doubly sub-linear interactive proofs of proximity
From MaRDI portal
Cites work
- A sublinear bipartiteness tester for bounded degree graphs
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- Batch verification and proofs of proximity with polylog overhead
- Constant-round interactive proofs for delegating computation
- Delegating computation: interactive proofs for muggles
- Doubley-efficient interactive proofs for distribution properties
- Fast approximate probabilistically checkable proofs
- scientific article; zbMATH DE number 3913677 (Why is no real title available?)
- Interactive proofs for verifying machine learning
- Interactive proofs of proximity: delegating computation in sublinear time
- Introduction to Property Testing
- Lower bounds for sampling algorithms for estimating the average
- On doubly-efficient interactive proof systems
- Proofs of proximity for context-free languages and read-once branching programs
- Proofs of proximity for distribution testing
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testing Membership in Languages that Have Small Width Branching Programs
- Tolerant property testing and distance approximation
- Verifying the unseen: interactive proofs for label-invariant distribution properties
This page was built for publication: Doubly sub-linear interactive proofs of proximity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296634)
