Pages that link to "Item:Q1767978"
From MaRDI portal
The following pages link to Fast approximate PCPs for multidimensional bin-packing problems (Q1767978):
Displaying 15 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Parameterized property testing of functions (Q4638061) (← links)
- (Q4638079) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← 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)
- Isoperimetric inequalities for real-valued functions with applications to monotonicity testing (Q6641061) (← links)
