![]() |
My Project
|
factory_page
More...Directories | |
| include | |
| templates | |
Files | |
| canonicalform.cc | |
| canonicalform.h | |
| Header for factory's main class CanonicalForm. | |
| cf_algorithm.cc | |
| cf_algorithm.h | |
| declarations of higher level algorithms. | |
| cf_assert.h | |
| assertions for Factory | |
| cf_binom.cc | |
| cf_binom.h | |
| cf_char.cc | |
| getting and setting the characteristic of a finite field | |
| cf_chinese.cc | |
| algorithms for chinese remaindering and rational reconstruction | |
| cf_cyclo.cc | |
| Compute cyclotomic polynomials and factorize integers by brute force. | |
| cf_cyclo.h | |
| Compute cyclotomic polynomials and factorize integers by brute force. | |
| cf_defs.h | |
| factory switches. | |
| cf_eval.cc | |
| cf_eval.h | |
| evaluate polynomials at points | |
| cf_factor.cc | |
| Interface to factorization and square free factorization algorithms. | |
| cf_factory.cc | |
| cf_factory.h | |
| Interface to generate InternalCF's over various domains from intrinsic types or mpz_t's. | |
| cf_gcd.cc | |
| gcd/content/lcm of polynomials | |
| cf_generator.cc | |
| cf_generator.h | |
| generate integers, elements of finite fields | |
| cf_globals.cc | |
| definitions of global variables. | |
| cf_globals.h | |
| cf_hnf.cc | |
| HNF/LLL of NTL. | |
| cf_hnf.h | |
| cf_inline.cc | |
| definition of configurable inline `CanonicalForm' methods. | |
| cf_irred.cc | |
| cf_irred.h | |
| generate random irreducible univariate polynomials | |
| cf_iter.cc | |
| cf_iter.h | |
| Iterators for CanonicalForm's. | |
| cf_iter_inline.cc | |
| definition of configurable inline `CFIterator' methods. | |
| cf_linsys.cc | |
| solve linear systems and compute determinants of matrices | |
| cf_map.cc | |
| definition of class CFMap. | |
| cf_map.h | |
| map polynomials | |
| cf_map_ext.cc | |
| This file implements functions to map between extensions of finite fields. | |
| cf_map_ext.h | |
| This file implements functions to map between extensions of finite fields. | |
| cf_ops.cc | |
| simple structural algorithms. | |
| cf_primes.cc | |
| cf_primes.h | |
| access to prime tables | |
| cf_primetab.h | |
| cf_random.cc | |
| cf_random.h | |
| generate random integers, random elements of finite fields | |
| cf_resultant.cc | |
| algorithms for calculating resultants. | |
| cf_reval.cc | |
| cf_reval.h | |
| generate random evaluation points | |
| cf_roots.cc | |
| cf_roots.h | |
| cf_switches.cc | |
| definition of class CFSwitches. | |
| cf_switches.h | |
| header to cf_switches.cc. | |
| cf_util.cc | |
| miscellaneous functions, not necessarily related to canonical forms. | |
| cf_util.h | |
| cfCharSets.cc | |
| This file provides functions to compute characteristic sets. | |
| cfCharSets.h | |
| This file provides functions to compute characteristic sets. | |
| cfCharSetsUtil.cc | |
| This file provides utility functions to compute characteristic sets. | |
| cfCharSetsUtil.h | |
| This file provides utility functions to compute characteristic sets. | |
| cfEzgcd.cc | |
| This file implements the GCD of two multivariate polynomials over Q or F_q using EZ-GCD as described in "Algorithms for Computer Algebra" by Geddes, Czapor, Labahnn. | |
| cfEzgcd.h | |
| Extended Zassenhaus GCD over finite fields and Z. | |
| cfGcdAlgExt.cc | |
| cfGcdAlgExt.h | |
| GCD over Q(a). | |
| cfGcdUtil.cc | |
| cfGcdUtil.h | |
| coprimality check and change of representation mod n | |
| cfModGcd.cc | |
This file implements the GCD of two polynomials over ![]() ![]() | |
| cfModGcd.h | |
| modular and sparse modular GCD algorithms over finite fields and Z. | |
| cfModResultant.cc | |
| modular resultant algorithm | |
| cfModResultant.h | |
| modular resultant algorithm as described by G. | |
| cfNewtonPolygon.cc | |
| This file provides functions to compute the Newton polygon of a bivariate polynomial. | |
| cfNewtonPolygon.h | |
| This file provides functions to compute the Newton polygon of a bivariate polynomial. | |
| cfNTLzzpEXGCD.cc | |
| cfNTLzzpEXGCD.h | |
| This file defines functions for univariate GCD and extended GCD over Z/p[t]/(f)[x] for reducible f. | |
| cfSubResGcd.cc | |
| cfSubResGcd.h | |
| subresultant pseudo remainder sequence GCD over finite fields and Z | |
| cfUnivarGcd.cc | |
| cfUnivarGcd.h | |
| univariate Gcd over finite fields and Z, extended GCD over finite fields and Q | |
| debug.cc | |
| debug.h | |
| functions to print debug output | |
| DegreePattern.cc | |
| This file provides functions for manipulating DegreePatterns. | |
| DegreePattern.h | |
| This file provides a class to handle degree patterns. | |
| ExtensionInfo.cc | |
| This file provides member functions for ExtensionInfo. | |
| ExtensionInfo.h | |
| This file provides a class to store information about finite fields and extensions thereof. | |
| fac_berlekamp.cc | |
| fac_berlekamp.h | |
| fac_cantzass.cc | |
| fac_cantzass.h | |
| fac_distrib.cc | |
| fac_distrib.h | |
| fac_iterfor.cc | |
| fac_iterfor.h | |
| fac_multihensel.cc | |
| fac_multihensel.h | |
| fac_multivar.cc | |
| fac_multivar.h | |
| fac_sqrfree.cc | |
| fac_sqrfree.h | |
| squarefree part and factorization over Q, Q(a) | |
| fac_univar.cc | |
| fac_univar.h | |
| fac_util.cc | |
| fac_util.h | |
| operations mod p^k and some other useful functions for factorization | |
| facAbsBiFact.cc | |
| facAbsBiFact.h | |
| bivariate absolute factorization over Q described in "Modular Las Vegas
Algorithms for Polynomial Absolute Factorization" by Bertone, Chèze, Galligo | |
| facAbsFact.cc | |
| facAbsFact.h | |
| absolute multivariate factorization over Q | |
| facAlgExt.cc | |
| Univariate factorization over algebraic extension of Q using Trager's algorithm. | |
| facAlgExt.h | |
| Univariate factorization over algebraic extension of Q using Trager's algorithm. | |
| facAlgFunc.cc | |
| This file provides functions to factorize polynomials over alg. | |
| facAlgFunc.h | |
| Factorization over algebraic function fields. | |
| facAlgFuncUtil.cc | |
| This file provides utility functions to factorize polynomials over alg. | |
| facAlgFuncUtil.h | |
| Utility functions for factorization over algebraic function fields. | |
| facBivar.cc | |
| bivariate factorization over Q(a) | |
| facBivar.h | |
| bivariate factorization over Q(a) | |
| facFactorize.cc | |
| multivariate factorization over Q(a) | |
| facFactorize.h | |
| multivariate factorization over Q(a) | |
| facFqBivar.cc | |
This file provides functions for factorizing a bivariate polynomial over ![]() ![]() | |
| facFqBivar.h | |
This file provides functions for factorizing a bivariate polynomial over ![]() ![]() | |
| facFqBivarUtil.cc | |
| This file provides utility functions for bivariate factorization. | |
| facFqBivarUtil.h | |
| This file provides utility functions for bivariate factorization. | |
| facFqFactorize.cc | |
| This file implements functions for factoring a multivariate polynomial over a finite field. | |
| facFqFactorize.h | |
This file provides functions for factorizing a multivariate polynomial over ![]() ![]() | |
| facFqFactorizeUtil.cc | |
| This file provides utility functions for multivariate factorization. | |
| facFqFactorizeUtil.h | |
| This file provides utility functions for multivariate factorization. | |
| facFqSquarefree.cc | |
This file provides functions for squarefrees factorizing over ![]() ![]() | |
| facFqSquarefree.h | |
This file provides functions for squarefrees factorizing over ![]() ![]() | |
| facHensel.cc | |
| This file implements functions to lift factors via Hensel lifting. | |
| facHensel.h | |
| This file defines functions for Hensel lifting. | |
| facIrredTest.cc | |
| This file implements a probabilistic irreducibility test for polynomials over Z/p. | |
| facIrredTest.h | |
| This file provides a probabilistic irreducibility test for polynomials over Z/p. | |
| facMul.cc | |
| This file implements functions for fast multiplication and division with remainder. | |
| facMul.h | |
| This file defines functions for fast multiplication and division with remainder. | |
| facSparseHensel.cc | |
| This file implements functions for sparse heuristic Hensel lifting. | |
| facSparseHensel.h | |
| This file provides functions for sparse heuristic Hensel lifting. | |
| factory.h | |
| factory.h' is the user interface to Factory.
| |
| factoryconf.h | |
| factoryconf.h' serves as a configuration file for the
installed source files (templates and factory.h') the same way as config.h' serves as a configuration file for the
source files from which the library is build.
| |
| ffops.cc | |
| ffops.h | |
| operations in a finite prime field F_p. | |
| FLINTconvert.cc | |
| This file implements functions for conversion to FLINT (www.flintlib.org) and back. | |
| FLINTconvert.h | |
| This file defines functions for conversion to FLINT (www.flintlib.org) and back. | |
| ftmpl_inst.cc | |
| Factory's template instantiations. | |
| gengftables-conway.cc | |
| generate addition tables used by Factory to calculate in GF(q). | |
| gf_tabutil.cc | |
| gf_tabutil.h | |
| utility functions to access GF Tables | |
| gfops.cc | |
| gfops.h | |
| Operations in GF, where GF is a finite field of size less than 2^16 represented by a root of Conway polynomial. | |
| globaldefs.h | |
| gmpext.h | |
| utility functions for gmp | |
| imm.cc | |
| imm.h | |
| operations on immediates, that is elements of F_p, GF, Z, Q that fit into intrinsic int, long | |
| int_cf.cc | |
| int_cf.h | |
| Factory's internal CanonicalForm's. | |
| int_int.cc | |
| int_int.h | |
| Factory's internal integers. | |
| int_intdiv.cc | |
| 'InternalInteger' division algorithms. | |
| int_poly.cc | |
| int_poly.h | |
| Factory's internal polynomials. | |
| int_pp.cc | |
| int_pp.h | |
| int_rat.cc | |
| int_rat.h | |
| Factory's internal rationals. | |
| NTLconvert.cc | |
| NTLconvert.h | |
| Conversion to and from NTL. | |
| parseutil.cc | |
| parseutil.h | |
| readcf.cc | |
| si_log2.h | |
| singext.cc | |
| singext.h | |
| helper functions for conversion to and from Singular | |
| test_install.cc | |
| threadsupport.cc | |
| timing.h | |
| variable.cc | |
| variable.h | |
| operations on variables | |
factory_page