include/lacunaryx/linear_factors_bivariate.hpp File Reference

#include <lacunaryx/linear_factors_univariate.hpp>
#include <factorix/irreducible_polynomial_polynomial.hpp>

Go to the source code of this file.

Namespaces

namespace mmx
namespace mmx::lacunaryx

Defines

#define Monomial monomial< vector<E> >
#define Sparse_polynomial sparse_polynomial<C, Monomial, V>
#define Univariate_polynomial polynomial<C>
#define Bivariate_polynomial polynomial<polynomial<C> >
#define Bivariate_factor irreducible_factor< polynomial <polynomial<rational> > >
#define Bivariate_factors vector<Bivariate_factor>
#define Sparse_factor irreducible_factor<Sparse_polynomial>
#define Sparse_factors vector<Sparse_factor>

Functions

template<typename C , typename V1 , typename V2 , typename M , typename W > void set_as_bivariate_polynomial (polynomial< polynomial< C, V2 >, V1 > &p, const sparse_polynomial< C, M, W > &q)
template<typename C , typename M , typename W > polynomial< polynomial< C > > as_bivariate_polynomial (const sparse_polynomial< C, M, W > &q)
template<typename C , typename E , typename V > sparse_polynomial< C, monomial
< vector< E > >, V > as_sparse_polynomial (const polynomial< polynomial< rational > > &q)
template<typename C , typename E , typename V > irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > as_sparse_factor (const irreducible_factor< polynomial< polynomial< rational > > > &f)
template<typename C , typename E , typename V > sparse_polynomial< C, monomial
< vector< E > >, V > homogenize (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
template<typename E , typename C , typename V > E w_deg (const sparse_polynomial< C, monomial< vector< E > >, V > &p, vector< E > w)
template<typename E > E w_deg (const monomial< vector< E > > m, vector< E > w)
template<typename E , typename C , typename V > vector< nat > sort_poly (const sparse_polynomial< C, monomial< vector< E > >, V > &q, vector< E > w)
template<typename E , typename C , typename V > vector< nat > sort_poly (const sparse_polynomial< C, monomial< vector< E > >, V > &q, nat var)
template<typename E , typename C , typename V > vector< sparse_polynomial< C,
monomial< vector< E > >, V > > w_homogeneous_parts (const sparse_polynomial< C, monomial< vector< E > >, V > &p, vector< E > w)
template<typename E , typename C , typename V > vector< sparse_polynomial< C,
monomial< vector< E > >, V > > partition_bivariate_helper (const sparse_polynomial< C, monomial< vector< E > >, V > &q, nat var)
template<typename E , typename C , typename V > vector< sparse_polynomial< C,
monomial< vector< E > >, V > > partition_bivariate (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > truly_bivariate_linear_factors (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > linear_factors_bivariate_naive (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > linear_factors_bivariate (const sparse_polynomial< C, monomial< vector< E > >, V > &p)