> <\body> Multivariate polynomials in dense representation over with monomials of type are implemented in the class C,Monomial,V\>|mmx::block_polynomial> defined in |multimix/block_polynomial.hpp>. The default variant |mmx::block_polynomial_naive> assumes that is a field, not necessarily commutative, and provides implementations of the naive algorithms. For instance the product and the division have quadratic costs. <\cpp-code> #include \numerix/integer.hpp\ #include \multimix/block_polynomial.hpp\ ... monomial\\ e (vec\nat\ (1, 2)); block_polynomial\integer\ t1 (integer (2), e); // defines the term 2 * x * y^2 The bracket operator is overloaded to access either the -th coefficient with respect to the internal representation order, or to retrieve the coefficient of a monomial given in argument. Reducing the polynomial product to the univariate one (from the library), known as the Kronecker substitution, is implemented in the variant |mmx::block_polynomial_kronecker>. Special variants are available to , , , , and modular integers.\ . If you don't have this file, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.> <\initial> <\collection>