Pages that link to "Item:Q5547731"
From MaRDI portal
The following pages link to A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof (Q5547731):
Displaying 22 items.
- Unbounded-error quantum query complexity (Q638526) (← links)
- On discretization in generalized rational approximation (Q759337) (← links)
- Discretization for uniform polynomial approximation (Q788927) (← links)
- Varying norms and constraints (Q1109263) (← links)
- A comparison of uniform and discrete polynomial approximation (Q1136010) (← links)
- Deviation of best discrete and uniform polynomial approximants (Q1161871) (← links)
- Gram polynomials and the Kummer function (Q1270292) (← links)
- On the degree of Boolean functions as real polynomials (Q1346612) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- Birefringence in viscoelastic materials (Q1393991) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- On separation between the degree of a Boolean function and the block sensitivity (Q2117108) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Computational methods for best spline function approximation (Q2534809) (← links)
- Approximations of functions of several variables: Product Chebychev approximations. I (Q2537820) (← links)
- Interpolating subspaces in approximation theory (Q2538431) (← links)
- Minimum error bounds for multidimensional spline approximation (Q2550603) (← links)
- Discrete Tchebycheff approximation for multivariate splines (Q2554850) (← links)
- On vectorial approximation (Q2562984) (← links)
- A note on discrete Čebysev approximation (Q3915423) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5092454) (← links)
