Pages that link to "Item:Q4907584"
From MaRDI portal
The following pages link to An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584):
Displaying 38 items.
- Information lower bounds via self-reducibility (Q504999) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Local minimality of the ball for the Gaussian perimeter (Q1739068) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- Symmetry of minimizers of a Gaussian isoperimetric problem (Q2182121) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Low correlation noise stability of symmetric sets (Q2664537) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- (Q2816409) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- The Complexity of Data Aggregation in Directed Networks (Q3095346) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- (Q5092472) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121897) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
- (Q5419074) (redirect page) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- (Q6062160) (← links)
- Communication and information complexity (Q6200329) (← links)
