Pages that link to "Item:Q845704"
From MaRDI portal
The following pages link to The communication complexity of the Hamming distance problem (Q845704):
Displaying 10 items.
- Space lower bounds for online pattern matching (Q390881) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (Q2828234) (← links)
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- (Q5121896) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- (Q6084405) (← links)
