*Polynomial_d*

### Definition

A model of *Polynomial_d* is representing a multivariate
polynomial in d ≥ 1 variables over some basic ring R.
This type is denoted as the innermost coefficient.
A model of *Polynomial_d* accompanied by a traits class
*CGAL::Polynomial_traits_d<Polynomial_d>*, which is a model of
*PolynomialTraits_d*.
Please have a look at the concept *PolynomialTraits_d*, since nearly
all functionality related to polynomials is provided by the traits.

### Refines

*IntegralDomainWithoutDivision*

The algebraic structure of *Polynomial_d* depends on the
algebraic structure of *Innermost_coefficient_type*:

Note: In case the polynomial is univariate and the innermost coefficient is a *Field* the polynomial is model of *EuclideanRing*.

### See Also

*AlgebraicStructureTraits*

*PolynomialTraits_d*

### Has Models

*CGAL::Polynomial<Coeff>*