polynomial
IPA: pɑɫinˈoʊmiʌɫ
noun
- (algebra, strict sense) An expression consisting of a sum of a finite number of terms, each term being the product of a constant coefficient and one or more variables raised to a non-negative integer power, such as a_nxⁿ+a_n-1xⁿ⁻¹+...+a_0x⁰.
- (taxonomy) A taxonomic designation (such as of a subspecies) consisting of more than two terms.
adjective
- (algebra) Able to be described or limited by a polynomial.
- (taxonomy) of a polynomial name or entity
Advertisement
Examples of "polynomial" in Sentences
- Multiply the binomial with the polynomial.
- Consider the problem of factoring the polynomial.
- The graph of the cubic polynomial on the real line.
- In this equation, d is called the polynomial's degree.
- Suppose that the interpolation polynomial is in the form.
- For the cubic polynomial , roots of the equation satisfy.
- One of the methods is based on the permutation polynomials.
- A cyclotomic field is the splitting field of the polynomial.
- It is the generalization of the binomial theorem to polynomials.
- It is the closure of the trigonometric polynomials under the norm.
- It is the closure of the trigonometric polynomials under the seminorm.
- The degree of the polynomial is the degree of the term with highest degree.
- Also, all such calculations are done modulo another polynomial, which is called the irreducible polynomial for the field.
- In the above examples, each piecewise polynomial is defined on an interval with the same length and thus forms a uniform basis.
- This isn't a trivial difference; a model that can solve a problem in polynomial time really is fundamentally more powerful than one that takes exponential time.
- We call a polynomial p (x) with integer coefficients irreducible if p (x) cannot be written as a product of two polynomials with integer coefficients neither of which is a constant.
- And there are tons of computational complexity classes above the standard P and NP that represent problems that deterministic and non-deterministic Turing Machines can solve in polynomial time.
- -- Key wireless functions such as polynomial generation and multiply - accumulate for de-spreading functions (up to 16 complex code MACs/cycle) -- High precision FFTs with adaptive range management
- The idea was to start a pendulum from several different heights in order to cover a range of velocities and then to use simultaneous algebraic equations to fit a two or three term polynomial to two or three lost-arc data-points, changing the exponents until the polynomial achieved good agreement with the other lost-arc data points.