FORM 4.3
Data Structures | Functions
polygcd.cc File Reference
#include "poly.h"
#include "polygcd.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>

Go to the source code of this file.

Data Structures

struct  BracketInfo
 

Functions

bool gcd_heuristic_possible (const poly &a)
 
const poly gcd_linear_helper (const poly &a, const poly &b)
 

Detailed Description

Contains the routines for calculating greatest commons divisors of multivariate polynomials

Definition in file polygcd.cc.

Function Documentation

◆ gcd_heuristic_possible()

bool gcd_heuristic_possible ( const poly & a)

Heuristic greatest common divisor of multivariate polynomials

Description

Checks whether the heuristic seems possible by estimating

MAX_{terms} (coeff ^ PROD_{i=1..#vars} (pow_i+1))

and comparing this with GCD_HEURISTIC_MAX_DIGITS.

Notes

  • For small polynomials, this consumes time and never triggers.

Definition at line 1144 of file polygcd.cc.

◆ gcd_linear_helper()

const poly gcd_linear_helper ( const poly & a,
const poly & b )

Definition at line 1405 of file polygcd.cc.