In this paper, we present an algorithm using the GPGPU machine to compute the interval solutions of isolated real zeros of multivariate polynomial functions in given ranges. To overcome the state ...

Learn what polynomial-time reduction is, how to apply it to common problems, and why it is useful for finding efficient algorithms. See examples of polynomial-time reduction in action.

Hermite polynomials: A sequence of orthogonal polynomials associated with the weight function exp (–x²), widely used in probability, physics and signal analysis.

One of the well-known graph families F for which this is possible is the class of interval graphs, where a longest path can be computed by a dynamic programming algorithm with running time O(n4). 25 ...

A robust procedure is developed for estimating density functions from data. It requires the existence of a parametric function, called the key function, to give a first approximation to the density ...