BWAPI
|
#include <CGAL/basic.h>
#include <CGAL/Scalar_factor_traits.h>
#include <CGAL/Chinese_remainder_traits.h>
#include <CGAL/Algebraic_extension_traits.h>
#include <CGAL/primes.h>
#include <CGAL/Residue.h>
#include <CGAL/Polynomial/modular_gcd.h>
#include <CGAL/Polynomial/Cached_extended_euclidean_algorithm.h>
#include <CGAL/Polynomial.h>
#include <CGAL/Polynomial/modular_gcd_utils.h>
#include <CGAL/Cache.h>
#include <CGAL/Real_timer.h>
Go to the source code of this file.
Namespaces | |
namespace | CGAL |
namespace | CGAL::CGALi |
Functions | |
template<class NT > | |
Polynomial< NT > | CGAL::CGALi::gcd_utcf_Integral_domain (Polynomial< NT >, Polynomial< NT >) |
template<class NT > | |
Polynomial< Polynomial< NT > > | CGAL::CGALi::modular_gcd_utcf_dfai (const Polynomial< Polynomial< NT > > &FF1, const Polynomial< Polynomial< NT > > &FF2) |
template<class NT > | |
Polynomial< NT > | CGAL::CGALi::modular_gcd_utcf_dfai (const Polynomial< NT > &FF1_, const Polynomial< NT > &FF2_) |
provides gcd for Polynomials, based on Modular arithmetic.