Results 11 to 20 of about 1,293,710 (359)
The degree of monotone approximation [PDF]
Pacific Journal of Mathematics, 1978 R. K. Beatson
openalex +3 more sources
Degree of approximation by monotone polynomials I
Journal of Approximation Theory, 1968 G. Lorentz, K. Zeller
semanticscholar +3 more sources
Low-Degree Approximation of Random Polynomials [PDF]
Foundations of Computational Mathematics, 2021 AbstractWe prove that with “high probability” a random Kostlan polynomial in $$n+1$$ n + 1 many variables and of degree d can be approximated by a polynomial of “low degree” without changing the topology of its zero set on the sphere ...
Diatta, Daouda Niang, Lerario, Antonio
openaire +3 more sources
Degree of Approximation on a Jordan Curve. [PDF]
Proceedings of the National Academy of Sciences, 1952 J. Walsh, H. Elliott
semanticscholar +3 more sources
Lower bounds for the degree of approximation [PDF]
Transactions of the American Mathematical Society, 1960 is the optimal degree of approximation of 2W. In this paper we shall give simple methods which permit to find the order of magnitude of Dn(W) for several important classes ?1: for some classes of analytic functions (?6); for the unit ball AP+a of the space CP+a of functions with continuous derivatives of order p, which satisfy a Lipschitz condition ...
G. Lorentz
semanticscholar +2 more sources
The degree of approximation by linear operators [PDF]
Proceedings of the American Mathematical Society, 1965 Philip C. Curtis
openalex +3 more sources
Degree of adaptive approximation [PDF]
Mathematics of Computation, 1990 We obtain various estimates for the error in adaptive approximation and also establish a relationship between adaptive approximation and free-knot spline approximation.
DeVore, Ronald A, XIANG, Ming Yu
openaire +1 more source
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 This subsumes an earlier preprint by a subset of the authors (arXiv:2004.13231)
Aaronson, Scott +4 more
openaire +2 more sources
The degree of approximation by Chebyshevian splines [PDF]
Transactions of the American Mathematical Society, 1973 This paper studies the connections between the smoothness of a function and its degree of approximation by Chebyshevian splines. This is accomplished by proving companion direct and inverse theorems which give a characterization of smoothness in terms of degree of approximation. A determination of the saturation properties is included.
DeVore, R., Richards, F.
openaire +2 more sources
Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP [PDF]
, 2010 Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple semidefinite ...
Yoshida, Yuichi
core +1 more source