Bernstein polynomial estimation provides a robust nonparametric technique for approximating both density and distribution functions. Based on the properties of Bernstein polynomials, which uniformly ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

ABSTRACT: In this paper, we mainly study the uniqueness of specific q-shift difference polynomials and of meromorphic functions, which share a common small function and get the corresponding results.

This paper mainly studies some properties of skew polynomial ring related to Morita invariance, Armendariz and (quasi)-Baer. First, we show that skew polynomial ring has no Morita invariance by the ...

Abstract: The main focus of this investigation is the applications of Sigmoid functions. Due to its various uses in physics, engineering, and computer science, we introduce Bell-based ...

Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...

The polynomial-solutions of the self-adjoint differential equations $D\left[ {\exp \left( { - x_1^{2k}} \right)Dy} \right] + \lambda {x^{2k - 2}}\exp \left( { - {x ...

Abstract: Stochastic Barrier Functions (SBFs) certify the safety of stochastic systems by formulating a functional optimization problem, which state-of-the-art methods solve using Sum-of-Squares (SoS) ...