The following pages link to (Q3002788):
Displaying 13 items.
- Certifying equality with limited interaction (Q343864) (← links)
- Best-order streaming model (Q534570) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- (Q5875509) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- Communication and information complexity (Q6200329) (← links)
