\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.13.2 - Algebraic Kernel
List of all members
AlgebraicKernel_d_2::IsSquareFree_2 Concept Reference
Algebraic Kernel Reference » Concepts » Bivariate Algebraic Kernel

Definition

Computes whether the given bivariate polynomial is square free.

Refines:
AdaptableUnaryFunction
See also
AlgebraicKernel_d_2::MakeSquareFree_2
AlgebraicKernel_d_2::SquareFreeFactorize_2

Types

typedef bool result_type
 
typedef AlgebraicKernel_d_2::Polynomial_2 argument_type
 

Operations

result_type operator() (const argument_type &p)
 Computes whether \( p\) is square free.