The following pages link to (Q3549651):
Displaying 17 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- The learnability of quantum states (Q3508097) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- (Q5089155) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
- (Q5875456) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
