The public key is given by the multivariate polynomials over .

There are irreducible multivariate polynomials of every degree over the complex numbers.

Permutation and matrix groups have a natural action on multivariate polynomial rings.

Monomial degree is fundamental to the theory of univariate and multivariate polynomials.

It is consistently faster than some well known computer algebra systems, especially in multivariate polynomial gcd.

Magma contains a powerful system for computing with ideals of multivariate polynomial rings.

Her method employs the expansion of multivariate polynomials to devise a weaving scheme.

It is possible within Magma to assign weights to the variables of a multivariate polynomial ring.

For now, we have talked about everything we need for the multivariate polynomial .

In Charo, a multivariate polynomial matrix-factorization algorithm is introduced and discussed.

Consider the following hard problem: Give meaningful information about the number r of real solutions to a system of multivariate polynomial equations.

The key concept behind a Reed-Muller code is a multivariate polynomial of degree on variables.

The quotient by an ideal of a multivariate polynomial ring, filtered by the total degree.

This also applies to multivariate polynomials.

Multivariate polynomial rings are created from a coefficient ring, the number of indeterminates, and a monomial order.

In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field.

The problem of minimizing a quadratic multivariate polynomial on a cube is NP-hard.

Division algorithm for multivariate polynomials.

There are also known algorithms for the computation of the square-free decomposition of multivariate polynomials.

Algebraic geometry is the study of the solutions in an algebraically closed field of multivariate polynomial equations.

It is possible to further classify multivariate polynomials as bivariate, trivariate, and so on, according to the maximum number of indeterminates allowed.

Camellia is one of the ciphers that can be completely defined by minimal systems of multivariate polynomials .

Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials.

Therefore, each convergent can be expressed explicitly in terms of the continued fraction as the ratio of certain multivariate polynomials called continuants.

One can now compute the variety of any zero-dimensional multivariate polynomial ideal over the algebraic closure of its base field.