Testing Lipschitz functions on hypergrid domains
From MaRDI portal
Publication:270014
DOI10.1007/s00453-015-9984-yzbMath1333.68287OpenAlexW2001834374MaRDI QIDQ270014
Pranjal Awasthi, Madhav Jha, Sofya Raskhodnikova, Marco Molinaro
Publication date: 6 April 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-9984-y
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Is submodularity testable?
- Ricci curvature of Markov chains on metric spaces
- Self-testing/correcting with applications to numerical problems
- Spot-checkers
- Fast approximate PCPs for multidimensional bin-packing problems
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Testing low-degree polynomials over prime fields
- Introduction to Testing Graph Properties
- Property testing and its connection to learning and approximation
- Testing Lipschitz Functions on Hypergrid Domains
- Sublinear Time Algorithms
- Testing Polynomials over General Fields
- Testing monotonicity over graph products
- Monotonicity testing over general poset domains
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy
- Transitive-Closure Spanners
- Sublinear-time Algorithms
- lgorithmic and Analysis Techniques in Property Testing
- L p -testing
- Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
- Estimating the distance to a monotone function
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
- Testing monotonicity
This page was built for publication: Testing Lipschitz functions on hypergrid domains
