Pages that link to "Item:Q5495812"
From MaRDI portal
The following pages link to Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (Q5495812):
Displaying 25 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Is submodularity testable? (Q472463) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- An \(o(n)\) monotonicity tester for Boolean functions over the hypercube (Q2805510) (← links)
- Testing monotonicity over graph products (Q3522829) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Parameterized property testing of functions (Q4638061) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces (Q5002641) (← links)
- Testing hereditary properties of sequences (Q5002650) (← links)
- Adaptive Lower Bound for Testing Monotonicity on the Line (Q5009526) (← links)
- (Q5009536) (← links)
- (Q5090383) (← links)
- Optimal unateness testers for real-valued functions: adaptivity helps (Q5140837) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313026) (← links)
- Automata, Languages and Programming (Q5466508) (← links)
- (Q5497118) (← links)
- Discrete and Computational Geometry (Q5897088) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
- (Q6087218) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
- Isoperimetric inequalities for real-valued functions with applications to monotonicity testing (Q6641061) (← links)
