up previous next
6.2.15 Polynomial Systems
The following are commands and functions for Solving Polynomial Systems:
Bertini.BCMSolve Solves a zero dimensional non-homogeneous polynomial system of equations using multi-homogenization and user configurations.
Bertini.BMSolve Solves a zero dimensional non-homogeneous polynomial system using multi-homogenization and default configurations.
Bertini.BPCSolve Computes numerical irreducible decomposition by finding witness point supersets of a positive dimensional homogeneous or non-homogeneous polynomial systems of equations.
Bertini.BPCSSolve Sampling a component for a positive dimensional homogeneous or non-homogeneous polynomial system.
Bertini.BPMCSolve Membership testing for a positive dimensional homogeneous or non-homogeneous polynomial system.
Bertini.BSolve Solves a zero dimensional homogeneous or non-homogeneous polynomial system of equations with default configurations.
Bertini.BUHSolve Solves a zero dimensional non-homogeneous polynomial system of equations by user defined homotopy.
Bertini.BZCSolve Solves a zero dimensional homogeneous or non-homogeneous polynomial system of equations using configurations provided by the user.
CharP.BBasisMutantStrategyF2 Computes a Border Basis of a given ideal over F_2.
CharP.IMBBasis Computes a Border Basis of a given ideal over F_2.
CharP.IMNLASolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.IMXLSolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.LAAlgorithm Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.MBBasis Computes a Border Basis of a given ideal over F_2.
CharP.MNLASolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.MXLSolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.NLASolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
CharP.XLSolve Computes the unique F_2-rational zero of a given polynomial system over F_2.
GLPK.IPCSolve Solves a system of polynomial equations over F_2 for one solution in F_2^n.
GLPK.L01PSolve Solve a system of polynomial equations over F_2 for one solution in F_2^n.
GLPK.RIPCSolve Solves a system of polynomial equations over F_2 for one solution in F_2^n.
GLPK.RPCSolve Solves a system of polynomial equations over F_2 for one solution in F_2^n.
GLPK.RRPCSolve Solves a system of polynomial equations over F_2 for one solution in F_2^n.
Hom.HSolve Solves a zero dimensional square homogeneous or non-homogeneous polynomial system of equations.
Hom.LRSolve Solves a non-square zero dimensional homogeneous or non-homogeneous polynomial system of equations.
Hom.SRSolve Solves a non-square zero dimensional homogeneous or non-homogeneous polynomial system of equations.
SAT.ConvertToCNF Converts a given quadratic (cubic) system of polynomial equations (SPE) over GF(2) to CNF. Writes the CNF to the file sat.cnf
SAT.ConvertToXOR Converts a given quadratic (cubic) system of polynomial equations (SPE) over GF(2) to XOR-CNF. Writes the XOR-CNF to the file sat_xor.cnf.
SAT.FixBits Allows to fix chosen bits in advance within a SAT input file. The new input file is sat_fixed.cnf.
SAT.GetResult Looks up the configuration of the indeterminates in the file output produced by a SAT-Solver. The file output must be in the folder ApCoCoA-directory/sat/bin.
SAT.LaunchCryptoMiniSat Launches CryptoMiniSat via the ApCoCoAServer on a given input file located in ApCoCoA-directory/sat/bin. The result is written to the file output.
SAT.LaunchMiniSat Launches MiniSat via the ApCoCoAServer on a given input file located in ApCoCoA-directory/sat/bin. The result is written to the file output.




For details look up each item by name. Online, try ?ItemName or H.Syntax("ItemName").