Pages that link to "Item:Q5700567"
From MaRDI portal
The following pages link to Some 3CNF Properties Are Hard to Test (Q5700567):
Displayed 39 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Property Testing of Massively Parametrized Problems – A Survey (Q4933366) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- (Q4993289) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5090414) (← links)
- (Q5090443) (← links)
- (Q5093398) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)