Pages that link to "Item:Q6074683"
From MaRDI portal
The following pages link to Approximating the distance to monotonicity of Boolean functions (Q6074683):
Displaying 18 items.
- On an approximate computation of the height of the maximal upper zero of a monotone Boolean function (Q1177787) (← links)
- The Boolean map distance: theory and efficient computation (Q1690418) (← links)
- An \(o(n)\) monotonicity tester for Boolean functions over the hypercube (Q2805510) (← links)
- Approximating the distance to monotonicity in high dimensions (Q2930335) (← links)
- (Q3119336) (← links)
- (Q3201116) (← links)
- A necessary and sufficient criterion for the monotonicity of Boolean functions with deterministic and stochastic applications (Q4420807) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- (Q4896366) (← links)
- (Q5146124) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313026) (← links)
- Estimating the distance to a monotone function (Q5433267) (← links)
- A o(n) monotonicity tester for boolean functions over the hypercube (Q5495811) (← links)
- (Q5498410) (← links)
- (Q6160890) (← links)
- Sample-based distance-approximation for subsequence-freeness (Q6586659) (← links)
- A counterexample to a directed KKL inequality (Q6635167) (← links)
- Isoperimetric inequalities for real-valued functions with applications to monotonicity testing (Q6641061) (← links)