Pages that link to "Item:Q2643136"
From MaRDI portal
The following pages link to Robust polynomials and quantum algorithms (Q2643136):
Displaying 14 items.
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- The hardest halfspace (Q1983325) (← links)
- Tangible reduction in learning sample complexity with large classical samples and small quantum system (Q2679052) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Robust Quantum Algorithms with ε-Biased Oracles (Q3591325) (← links)
- (Q4612487) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5091781) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5092483) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- Polynomial approximation on disjoint segments and amplification of approximation (Q6198118) (← links)
