Pages that link to "Item:Q3579209"
From MaRDI portal
The following pages link to Monotonicity testing over general poset domains (Q3579209):
Displaying 44 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Monotonicity testing and shortest-path routing on the cube (Q452855) (← links)
- Is submodularity testable? (Q472463) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Testing juntas (Q598252) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube (Q2805510) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← 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)
- (Q4638079) (← links)
- Property Testing of Massively Parametrized Problems – A Survey (Q4933366) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)
- A Polynomial Lower Bound for Testing Monotonicity (Q4994983) (← links)
- Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces (Q5002641) (← links)
- Adaptive Lower Bound for Testing Monotonicity on the Line (Q5009526) (← links)
- (Q5009536) (← links)
- Adaptive Boolean Monotonicity Testing in Total Influence Time (Q5090393) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- A characterization of constant‐sample testable properties (Q5236924) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- (Q5743414) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
- Isoperimetric inequalities for real-valued functions with applications to monotonicity testing (Q6641061) (← links)
