PoSSo

swMATH4646MaRDI QIDQ16816FDOQ16816

Author name not available (Why is that?)

Cited In (32)

• Numerical stability of path tracing in polyhedral homotopy continuation methods
• Parallel modular computation of Gröbner and involutive bases
• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
• Homotopy continuation method for solving systems of nonlinear and polynomial equations
• Parallel computation of Janet and Gröbner bases over rational numbers
• Title not available (Why is that?)
• An analysis of inhomogeneous signature-based Gröbner basis computations
• Efficiency estimate for distributed computation of Gröbner bases and involutive bases
• Spherical projective path tracking for homotopy continuation methods
• A survey on signature-based algorithms for computing Gröbner bases
• A filled function method for nonlinear systems of equalities and inequalities
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Unmixing the mixed volume computation
• Parallel algorithms for Gröbner-basis construction
• Certifying isolated singular points and their multiplicity structure
• Polynomial equation solving by lifting procedures for ramified fibers
• Algorithm 795
• Parallelization of modular algorithms
• Incomplete Gröbner basis as a preconditioner for polynomial systems
• Semantic-Aware Fingerprints of Symbolic Research Data
• Certifying properties of an efficient functional program for computing Gröbner bases
• On deflation and multiplicity structure
• Algorithm 835
• Mixed cell computation in HOM4ps
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Computer Algebra in Scientific Computing
• BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
• Involutive bases algorithm incorporating F\(_5\) criterion
• On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
• PHoM -- a polyhedral homotopy continuation method for polynomial systems
• Parallelization of triangular decompositions: techniques and implementation

This page was built for software: PoSSo