Pages that link to "Item:Q2963913"
From MaRDI portal
The following pages link to On Improved Degree Lower Bounds for Polynomial Approximation. (Q2963913):
Displaying 10 items.
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights (Q281549) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- The expressive power of voting polynomials (Q1330793) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- (Q4464663) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- (Q5090378) (← links)
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers (Q5410333) (← links)
- New degree bounds for polynomial threshold functions (Q5901091) (← links)