SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
utils.h File Reference
#include <carl-arith/poly/umvpoly/functions/Factorization.h>
#include <carl-arith/poly/umvpoly/functions/PrimitivePart.h>
#include <carl-arith/poly/umvpoly/functions/Resultant.h>
#include <carl-arith/poly/umvpoly/functions/SquareFreePart.h>
#include <carl-arith/poly/umvpoly/functions/to_univariate_polynomial.h>
Include dependency graph for utils.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  smtrat::cad::projection::Reducta< Poly >
 Construct the set of reducta of the given polynomial. More...
 

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::cad
 
 smtrat::cad::projection
 

Functions

template<typename Poly >
bool smtrat::cad::projection::doesNotVanish (const Poly &p)
 Tries to determine whether the given Poly vanishes for some assignment. More...
 
template<typename Poly >
Poly smtrat::cad::projection::normalize (const Poly &p)
 Normalizes the given Poly by removing constant and duplicate factors. More...
 
template<typename Poly >
Poly smtrat::cad::projection::resultant (carl::Variable variable, const Poly &p, const Poly &q)
 Computes the resultant of two polynomials. More...
 
template<typename Poly >
Poly smtrat::cad::projection::discriminant (carl::Variable variable, const Poly &p)
 Computes the discriminant of a polynomial. More...
 
template<typename Poly >
std::vector< Poly > smtrat::cad::projection::PSC (const Poly &p, const Poly &q)
 Computes the Principal Subresultant Coefficients of two polynomials. More...
 
template<typename Poly , typename Callback >
void smtrat::cad::projection::returnPoly (const Poly &p, Callback &&cb)