Space hierarchy theorem — In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For… … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the … Wikipedia
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Polynomial-time reduction — In computational complexity theory a polynomial time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many one reduction, it is called a polynomial time many one reduction, polynomial… … Wikipedia
Polynomial SOS — In mathematics, a homogeneous form h ( x ) of degree 2 m in the real n dimensional vector x is a SOS (sum of squares) of homogeneous forms if and only if it can be written as a sum of squares of homogeneous forms of degree m ::h(x) mbox{is SOS}… … Wikipedia
Minimal polynomial (linear algebra) — For the minimal polynomial of an algebraic element of a field, see Minimal polynomial (field theory). In linear algebra, the minimal polynomial μA of an n by n matrix A over a field F is the monic polynomial P over F of least degree such that… … Wikipedia
Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia
Homogeneous polynomial — In mathematics, a homogeneous polynomial is a polynomial whose terms are monomials all having the same total degree; or are elements of the same dimension. For example, x^5 + 2 x^3 y^2 + 9 x^1 y^4 is a homogeneous polynomial of degree 5, in two… … Wikipedia
Complex quadratic polynomial — A complex quadratic polynomial is a quadratic polynomial whose coefficients are complex numbers. Contents 1 Forms 2 Conjugation 2.1 Between forms 2.2 With doubling map … Wikipedia
