Pages that link to "Item:Q2912853"
From MaRDI portal
The following pages link to The Quantum Query Complexity of Read-Many Formulas (Q2912853):
Displaying 6 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- The average sensitivity of bounded-depth formulas (Q1653335) (← links)
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem (Q2331339) (← links)
- Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
