Pages that link to "Item:Q3614148"
From MaRDI portal
The following pages link to Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (Q3614148):
Displaying 11 items.
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- A quantum evolving secret sharing scheme (Q2024899) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY (Q3015424) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- (Q5140844) (← links)
- Quantum attribute-based encryption: a comprehensive study (Q6050246) (← links)
