Results 321 to 330 of about 3,729,724 (366)
Some of the next articles are maybe not open access.
Monotone separations for constant degree polynomials
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hrubeš, Pavel, Yehudayoff, Amir
openaire +1 more source
Local Lipschitz constants and Kolushov polynomials
Acta Mathematica Hungarica, 1991Let \(C[a,b]\) be the space of continuous real-valued functions on \([a,b]\) with uniform norm \(\|\;\|\). For \(f\) in \(C[a,b]\), let \(B_ n(f)\) denote the best uniform approximate from the set of algebraic polynomials of degree \(n\) or less to \(f\). \(E_ n(f)\) is the number of the extremal points of \(f-B_ n(f)\).
Bartelt, M. W., Swetits, J. J.
openaire +1 more source
Constant Regression Polynomials and the Wishart Distribution
SIAM Journal on Mathematical Analysis, 1989Summary: Results are obtained for the problems of constructing and characterizing scalar-valued polynomial statistics having constant regression on the mean of a random sample of Wishart matrices. The construction procedure introduced by \textit{B. Heller} [J. Multivariate Anal.
openaire +1 more source
Polynomial constants of motion in flat space
Journal of Mathematical Physics, 1984Some general results on commuting integrals for a Hamiltonian system are given. The question of the existence of integrals which are polynomial in the momenta is investigated and the results applied to a variety of mechanical systems.
openaire +1 more source
Asymptotic constants for multivariate Bernstein polynomials
Studia Scientiarum Mathematicarum Hungarica, 2003We study the rate of convergence of multivariate Bernstein polynomials on the class of Hölder continuous functions. Using a proper probabilistic representation we are able to derive the asymptotic constant.
openaire +1 more source
A new post-quantum multivariate polynomial public key encapsulation algorithm
Quantum Information Processing, 2022Randy Kuang +2 more
semanticscholar +1 more source
COUNTING HIERARCHIES: POLYNOMIAL TIME AND CONSTANT DEPTH CIRCUITS
1993\textit{Seinosuke Toda} [\(PP\) is \(\leq^ p_ T\)-hard for the polynomial time hierarchy, Proc. 30th IEEE Symp. on Foundations of Computer Science, 514-519 (1989)] proved that the polynomial hierarchy is contained in \(P^{PP}\) [To-89]. In this month's structural complexity column, we will briefly review Toda's result, and explore how it relates to ...
Allender, Eric W., Wagner, Klaus W.
openaire +2 more sources
Lebesgue constants in polynomial interpolation
2006Summary: Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the 'nodes'). However, the accuracy of the approximation is greatly influenced by the location of these nodes.
openaire +2 more sources
Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
Advances in Computational Mathematics, 1995H. Wendland
semanticscholar +1 more source