Pages that link to "Item:Q3588428"
From MaRDI portal
The following pages link to Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428):
Displaying 6 items.
- Property testing lower bounds via communication complexity (Q693004) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)