Pages that link to "Item:Q3581289"
From MaRDI portal
The following pages link to On the power of quantum fingerprinting (Q3581289):
Displaying 10 items.
- The communication complexity of the Hamming distance problem (Q845704) (← 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)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- (Q3522471) (← links)
- (Q3522527) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Optimal adjacency labels for subgraphs of Cartesian products (Q6581611) (← links)