Pages that link to "Item:Q3191588"
From MaRDI portal
The following pages link to Making polynomials robust to noise (Q3191588):
Displaying 12 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Robust polynomials and quantum algorithms (Q2643136) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← 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)
- STACS 2005 (Q5710710) (← links)
- (Q6062152) (← links)
- Polynomial approximation on disjoint segments and amplification of approximation (Q6198118) (← links)