Pages that link to "Item:Q5361886"
From MaRDI portal
The following pages link to Separations in query complexity using cheat sheets (Q5361886):
Displaying 26 items.
- On block sensitivity and fractional block sensitivity (Q1992105) (← links)
- Query complexity of generalized Simon's problem (Q2051810) (← links)
- Beyond quadratic speedups in quantum attacks on symmetric schemes (Q2170092) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- (Q4577913) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5088887) (← links)
- (Q5089146) (← links)
- (Q5091781) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← 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)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- (Q6062152) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
