The following pages link to (Q5414625):
Displaying 14 items.
- Certifying equality with limited interaction (Q343864) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- (Q5028429) (← links)
- (Q5090430) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- (Q5875509) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
