Pages that link to "Item:Q3642860"
From MaRDI portal
The following pages link to Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography (Q3642860):
Displaying 12 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Concentration on the Boolean hypercube via pathwise stochastic analysis (Q2097031) (← links)
- A quantum algorithm for approximating the influences of Boolean functions and its applications (Q2355587) (← links)
- The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Shadow Tomography of Quantum States (Q5130848) (← links)
- Optimal bounds for parity-oblivious random access codes (Q5855036) (← links)
