scientific article; zbMATH DE number 7559054
From MaRDI portal
Publication:5090383
DOI10.4230/LIPIcs.ITCS.2019.11MaRDI QIDQ5090383
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.07448
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Testing Lipschitz functions on hypergrid domains
- Is submodularity testable?
- Property testing lower bounds via communication complexity
- Spot-checkers
- On the strength of comparisons in property testing
- Fast-Match: fast affine template matching
- Regular Languages are Testable with a Constant Number of Queries
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Every Property of Hyperfinite Graphs Is Testable
- ON DISCRETE HESSIAN MATRIX AND CONVEX EXTENSIBILITY
- On Proximity-Oblivious Testing
- Testing Convexity of Figures Under the Uniform Distribution
- Property testing and its connection to learning and approximation
- Discrete Convex Analysis
- On Testing Convexity and Submodularity
- Tolerant testers of image properties
- Parameterized property testing of functions
- Robust Characterizations of Polynomials with Applications to Program Testing
- Property Testing on Product Distributions
- Sample-Based High-Dimensional Convexity Testing.
- Adaptive Lower Bound for Testing Monotonicity on the Line
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
- Earthmover Resilience and Testing in Ordered Structures
- L p -testing
- Introduction to Property Testing
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
This page was built for publication:
