The following pages link to (Q4228511):
Displaying 16 items.
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Equality, Revisited (Q2946382) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- (Q5005112) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Area laws and efficient descriptions of quantum many-body states (Q5855082) (← links)
- (Q6065460) (← links)
- Nearly optimal property preserving hashing (Q6108992) (← links)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols (Q6163951) (← links)