\hypertarget{polygcd_8cc}{}\doxysection{polygcd.\+cc File Reference}
\label{polygcd_8cc}\index{polygcd.cc@{polygcd.cc}}
{\ttfamily \#include \char`\"{}poly.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}polygcd.\+h\char`\"{}}\newline
{\ttfamily \#include $<$iostream$>$}\newline
{\ttfamily \#include $<$vector$>$}\newline
{\ttfamily \#include $<$cmath$>$}\newline
{\ttfamily \#include $<$map$>$}\newline
{\ttfamily \#include $<$algorithm$>$}\newline
\doxysubsection*{Data Structures}
\begin{DoxyCompactItemize}
\item 
struct \mbox{\hyperlink{structBracketInfo}{Bracket\+Info}}
\end{DoxyCompactItemize}
\doxysubsection*{Functions}
\begin{DoxyCompactItemize}
\item 
bool \mbox{\hyperlink{polygcd_8cc_a6f6168f47b7f60969ed6c8350f18eab3}{gcd\+\_\+heuristic\+\_\+possible}} (const \mbox{\hyperlink{classpoly}{poly}} \&a)
\item 
\mbox{\Hypertarget{polygcd_8cc_a47e08d9954a9e62cffebb81770799d34}\label{polygcd_8cc_a47e08d9954a9e62cffebb81770799d34}} 
const \mbox{\hyperlink{classpoly}{poly}} {\bfseries gcd\+\_\+linear\+\_\+helper} (const \mbox{\hyperlink{classpoly}{poly}} \&a, const \mbox{\hyperlink{classpoly}{poly}} \&b)
\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
Contains the routines for calculating greatest commons divisors of multivariate polynomials 

\doxysubsection{Function Documentation}
\mbox{\Hypertarget{polygcd_8cc_a6f6168f47b7f60969ed6c8350f18eab3}\label{polygcd_8cc_a6f6168f47b7f60969ed6c8350f18eab3}} 
\index{polygcd.cc@{polygcd.cc}!gcd\_heuristic\_possible@{gcd\_heuristic\_possible}}
\index{gcd\_heuristic\_possible@{gcd\_heuristic\_possible}!polygcd.cc@{polygcd.cc}}
\doxysubsubsection{\texorpdfstring{gcd\_heuristic\_possible()}{gcd\_heuristic\_possible()}}
{\footnotesize\ttfamily bool gcd\+\_\+heuristic\+\_\+possible (\begin{DoxyParamCaption}\item[{const \mbox{\hyperlink{classpoly}{poly}} \&}]{a }\end{DoxyParamCaption})}

Heuristic greatest common divisor of multivariate polynomials\hypertarget{polygcd_8cc_autotoc_md91}{}\doxysubsection{Description}\label{polygcd_8cc_autotoc_md91}
Checks whether the heuristic seems possible by estimating

M\+A\+X\+\_\+\{terms\} (coeff $^\wedge$ P\+R\+O\+D\+\_\+\{i=1..\#vars\} (pow\+\_\+i+1))

and comparing this with G\+C\+D\+\_\+\+H\+E\+U\+R\+I\+S\+T\+I\+C\+\_\+\+M\+A\+X\+\_\+\+D\+I\+G\+I\+TS.\hypertarget{polygcd_8cc_autotoc_md92}{}\doxysubsection{Notes}\label{polygcd_8cc_autotoc_md92}

\begin{DoxyItemize}
\item For small polynomials, this consumes time and never triggers. 
\end{DoxyItemize}

Definition at line 1144 of file polygcd.\+cc.

