Pages that link to "Item:Q4978064"
From MaRDI portal
The following pages link to Formula lower bounds via the quantum method (Q4978064):
Displaying 15 items.
- Closed-form formula on quantum factorization effectiveness (Q1937229) (← links)
- Quantum formulas: A lower bound and simulation (Q2784465) (← links)
- Dequantizing read-once quantum formulas (Q2958412) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- (Q5091189) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size (Q5386213) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)