Pages that link to "Item:Q693004"
From MaRDI portal
The following pages link to Property testing lower bounds via communication complexity (Q693004):
Displayed 17 items.
- Monotonicity testing and shortest-path routing on the cube (Q452855) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← 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)
- Efficient Sample Extractors for Juntas with Applications (Q3012831) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- (Q4638061) (← links)
- (Q4638079) (← links)
- Partially Symmetric Functions Are Efficiently Isomorphism Testable (Q5252692) (← links)
- On Active and Passive Testing (Q5364269) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)