Functions
template<typename Coeff >
UnivariatePolynomial< Coeff >	resultant_z3 (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q)
	A reimplementation of the resultant algorithm from z3. More...

template<typename Coeff >
UnivariatePolynomial< Coeff >	eliminate (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q)
	Eliminates the leading factor of p with q. More...

template<typename Coeff >
UnivariatePolynomial< Coeff >	resultant_det (const UnivariatePolynomial< Coeff > &p, const UnivariatePolynomial< Coeff > &q)
	An implementation of the naive resultant algorithm based on the silvester matrix. More...

Function Documentation

◆ eliminate()

template<typename Coeff >

UnivariatePolynomial<Coeff> carl::resultant_debug::eliminate	(	const UnivariatePolynomial< Coeff > &	p,
		const UnivariatePolynomial< Coeff > &	q
	)

Eliminates the leading factor of p with q.

Definition at line 431 of file Resultant.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename Coeff >

UnivariatePolynomial<Coeff> carl::resultant_debug::resultant_det	(	const UnivariatePolynomial< Coeff > &	p,
		const UnivariatePolynomial< Coeff > &	q
	)

An implementation of the naive resultant algorithm based on the silvester matrix.

Definition at line 448 of file Resultant.h.

Here is the call graph for this function:

template<typename Coeff >

UnivariatePolynomial<Coeff> carl::resultant_debug::resultant_z3	(	const UnivariatePolynomial< Coeff > &	p,
		const UnivariatePolynomial< Coeff > &	q
	)

A reimplementation of the resultant algorithm from z3.

Used for a comparative analysis of our own algorithm.

Definition at line 327 of file Resultant.h.

Here is the call graph for this function: