(mathematics) The complexity class where the runtime can be bounded (from above) by a polynomial in the input size.

(mathematics) Of an algorithm, which terminates in polynomial time.

(algebra) A polynomial which remains unchanged if its variables are permuted

(linear algebra) The polynomial produced from a given square matrix by first subtracting the appropriate identity matrix multiplied by an indeterminant and then calculating the determinant.

(mathematics) A real, multivariate homogeneous polynomial p(x) is hyperbolic (in direction e) if p(x-te) = 0 has only real roots as a function of t.

plural of polynomial function

(mathematics) Any of a two-parameter family of orthogonal polynomials indexed by a positive weight of a root system.

(linear algebra) For a given square matrix M over some field K, the smallest-degree monic polynomial over K which, when applied to M, yields the zero matrix.

plural of polynomial equation

(logic, algebra) A Boolean-valued polynomial formed as a XOR-sum (or "ring sum") of conjunctions.