Limitations of Local Filters of Lipschitz and Monotone Functions
From MaRDI portal
Publication:5890962
DOI10.1145/2692372.2692373zbMath1347.68360OpenAlexW2075208528MaRDI QIDQ5890962
Marco Molinaro, Madhav Jha, Pranjal Awasthi, Sofya Raskhodnikova
Publication date: 24 October 2016
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2692372.2692373
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Cites Work
- Property-preserving data reconstruction
- Self-testing/correcting with applications to numerical problems
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Property testing and its connection to learning and approximation
- On the efficiency of local decoding procedures for error-correcting codes
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Transitive-Closure Spanners
- Transitive-Closure Spanners: A Survey
- Local Monotonicity Reconstruction
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
- Theory of Cryptography
This page was built for publication: Limitations of Local Filters of Lipschitz and Monotone Functions