Pages that link to "Item:Q452855"
From MaRDI portal
The following pages link to Monotonicity testing and shortest-path routing on the cube (Q452855):
Displaying 16 items.
- Is submodularity testable? (Q472463) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube (Q2805510) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Parameterized property testing of functions (Q4638061) (← links)
- (Q4638079) (← links)
- A Polynomial Lower Bound for Testing Monotonicity (Q4994983) (← links)
- Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces (Q5002641) (← links)
- (Q5009536) (← links)
- (Q5140837) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
- Improved algorithm for permutation testing (Q6138826) (← links)
- Isoperimetric inequalities for real-valued functions with applications to monotonicity testing (Q6641061) (← links)
