In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the...
60 KB (8,176 words) - 08:55, 16 November 2024
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues...
19 KB (3,038 words) - 11:34, 3 October 2024
Time complexity (redirect from Polynomial time)
Quasi-polynomial time algorithms are algorithms whose running time exhibits quasi-polynomial growth, a type of behavior that may be slower than polynomial time...
41 KB (4,998 words) - 13:56, 19 November 2024
In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a...
21 KB (3,977 words) - 21:06, 13 September 2024
In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The...
17 KB (2,789 words) - 13:54, 2 October 2024
systems get a short check value attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated...
72 KB (5,953 words) - 06:47, 12 September 2024
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)} and...
61 KB (11,470 words) - 21:33, 11 November 2024
In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version...
13 KB (2,206 words) - 15:59, 22 October 2024
In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes...
47 KB (9,011 words) - 21:39, 19 November 2024
NP (complexity) (redirect from Nondeterministic polynomial time)
computer science) In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is...
21 KB (2,787 words) - 14:08, 19 September 2024
especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates (traditionally...
52 KB (8,218 words) - 10:33, 30 October 2024
In mathematics, a homogeneous polynomial, sometimes called quantic in older texts, is a polynomial whose nonzero terms all have the same degree. For example...
6 KB (1,039 words) - 12:03, 7 February 2024
Discriminant (redirect from Discriminant of a polynomial)
precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number...
41 KB (6,705 words) - 09:49, 12 November 2024
NP-completeness (redirect from Non-deterministic polynomial-time complete)
existence of a short (polynomial length) solution. The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force...
30 KB (3,617 words) - 17:49, 12 November 2024
numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials. The idea is named after mathematician...
25 KB (4,464 words) - 16:14, 14 September 2024
In statistics, polynomial regression is a form of regression analysis in which the relationship between the independent variable x and the dependent variable...
16 KB (2,426 words) - 05:32, 14 November 2024
and runs in polynomial time (as opposed to, say, exponential time) exists, meaning the task completion time is bounded above by a polynomial function on...
63 KB (7,782 words) - 18:22, 10 November 2024
mathematics, the order of a polynomial may refer to: the degree of a polynomial, that is, the largest exponent (for a univariate polynomial) or the largest sum...
804 bytes (144 words) - 16:07, 1 August 2024
Minimal polynomial can mean: Minimal polynomial (field theory) Minimal polynomial of 2cos(2pi/n) Minimal polynomial (linear algebra) This disambiguation...
169 bytes (50 words) - 20:57, 11 October 2022
an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of...
20 KB (2,849 words) - 15:55, 24 October 2024
Spline (mathematics) (redirect from Piecewise polynomial curve)
function defined piecewise by polynomials. In interpolating problems, spline interpolation is often preferred to polynomial interpolation because it yields...
26 KB (4,481 words) - 08:48, 28 September 2024
Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes...
26 KB (5,843 words) - 03:39, 13 December 2023
symmetric polynomial is a polynomial P(X1, X2, ..., Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally...
21 KB (3,833 words) - 01:08, 26 January 2024
In mathematics, a generic polynomial refers usually to a polynomial whose coefficients are indeterminates. For example, if a, b, and c are indeterminates...
4 KB (560 words) - 15:00, 14 February 2024
Eisenstein's criterion (redirect from Eisenstein polynomial)
mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers...
25 KB (3,592 words) - 11:40, 24 September 2024
In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence. The polynomials arise in: signal processing as Hermitian wavelets...
57 KB (10,041 words) - 18:16, 6 November 2024
A polynomial P is annihilating or called an annihilating polynomial in linear algebra and operator theory if the polynomial considered as a function of...
1 KB (107 words) - 16:53, 27 May 2024
In mathematics, the nth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor...
30 KB (5,071 words) - 06:25, 5 November 2024
mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a wide number of...
31 KB (5,593 words) - 11:34, 19 November 2024
abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous...
52 KB (7,886 words) - 07:23, 22 October 2024