Pages that link to "Item:Q845704"
From MaRDI portal
The following pages link to The communication complexity of the Hamming distance problem (Q845704):
Displaying 18 items.
- Space lower bounds for online pattern matching (Q390881) (← links)
- On the complexity of the identification problem in Hamming spaces (Q1403334) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Quantum protocol for privacy preserving Hamming distance problem of DNA sequences (Q2196999) (← links)
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (Q2828234) (← links)
- The communication complexity of gap Hamming distance (Q2913808) (← links)
- The Information Complexity Of Hamming Distance (Q2969639) (← 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)
- On the power of quantum fingerprinting (Q3581289) (← 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)
- (Q5414596) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems (Q5459157) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- (Q6084405) (← links)