Distribution-free proofs of proximity
From MaRDI portal
Cites work
- A theory of the learnable
- Almost optimal distribution-free junta testing
- An Unconditional Study of Computational Zero Knowledge
- Arguments of proximity (extended abstract)
- Average-Case Complexity
- Batch verification and proofs of proximity with polylog overhead
- Constant-round interactive proofs for delegating computation
- Delegating computation: interactive proofs for muggles
- Distribution-free connectivity testing for sparse graphs
- Distribution-free junta testing
- Distribution-Free Property-Testing
- Distribution-free testing for halfspaces (almost) requires PAC learning
- Distribution-Free Testing Lower Bounds for Basic Boolean Functions
- Distribution-Free Testing of Linear Functions on ℝⁿ
- Fast approximate probabilistically checkable proofs
- Fast Reed-Solomon interactive oracle proofs of proximity
- scientific article; zbMATH DE number 1241395 (Why is no real title available?)
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- scientific article; zbMATH DE number 7829309 (Why is no real title available?)
- Interactive oracle proofs of proximity to algebraic geometry codes
- Interactive proofs of proximity: delegating computation in sublinear time
- Introduction to Property Testing
- Local proofs approaching the witness length (extended abstract)
- Low degree testing over the reals
- Non-interactive proofs of proximity
- On the complexity of computational problems regarding distributions
- Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error
- Partial tests, universal tests and decomposability
- Proofs of proximity for distribution testing
- Property testing and its connection to learning and approximation
- Property testing. Problems and techniques
- Quantum algorithm for distribution-free junta testing
- Relaxed locally correctable codes
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust PSPs of proximity, shorter PSPs and applications to coding
- Testing graphs in vertex-distribution-free models
- The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution
- Tight bounds for the distribution-free testing of monotone conjunctions
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- VC dimension and distribution-free sample-based testing
- Verifying the unseen: interactive proofs for label-invariant distribution properties
- Zero-knowledge proofs of proximity
This page was built for publication: Distribution-free proofs of proximity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866470)
