A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Algorithms for computing triangular decomposition of polynomial systems
Localization and primary decomposition of polynomial ideals
Computational schemes for subresultant chains
Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case
A complete algorithm for automated discovering of a class of inequality-type theorems
Computing representations for radicals of finitely generated differential ideals
Characteristic set method for differential-difference polynomial systems
Computing differential characteristic sets by change of ordering
A new method for solving algebraic systems of positive dimension
Solving zero-dimensional algebraic systems
A zero structure theorem for differential parametric systems
Modular algorithms for computing Gröbner bases.
Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
On the theories of triangular sets
On the affine Bezout inequality
On solving parametric polynomial systems
Parallelization of triangular decompositions: techniques and implementation
An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
Computing the real solutions of polynomial systems with the RegularChains library in Maple
Ideals, Varieties, and Algorithms
Lifting techniques for triangular decompositions
Probabilistic algorithms for computing resultants
Triangular decomposition of semi-algebraic systems
Quantifier elimination by cylindrical algebraic decomposition based on regular chains

This page was built for publication: A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface