The following pages link to (Q4941829):
Displaying 50 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Monotonicity testing and shortest-path routing on the cube (Q452855) (← links)
- Is submodularity testable? (Q472463) (← 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)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Monotonicity properties of multiple endpoint testing procedures (Q1888877) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Static extensivity analysis for \(\lambda\)-definable functions over lattices (Q2493277) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Checking if there exist a monotonic function that is consistent with the measurements: an efficient algorithm (Q2572920) (← links)
- An \(o(n)\) monotonicity tester for Boolean functions over the hypercube (Q2805510) (← links)
- Testing Monotone Read-Once Functions (Q3111645) (← links)
- Monotonicity checking (Q3439281) (← links)
- Testing monotonicity over graph products (Q3522829) (← links)
- (Q4218414) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Parameterized property testing of functions (Q4638061) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Invariance in Property Testing (Q4933370) (← 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)
- Testing hereditary properties of sequences (Q5002650) (← links)
- Adaptive Lower Bound for Testing Monotonicity on the Line (Q5009526) (← links)
- (Q5009536) (← links)
- Adaptive Boolean Monotonicity Testing in Total Influence Time (Q5090393) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- Testing for forbidden order patterns in an array (Q5242883) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313026) (← links)
- Estimating the distance to a monotone function (Q5433267) (← links)
- Monotonicity Analysis Can Speed Up Verification (Q5459181) (← links)
- Automata, Languages and Programming (Q5466508) (← links)
- (Q5497118) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- Testing monotonicity (Q5932642) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
