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

Cites work

A complete algorithm for automated discovering of a class of inequality-type theorems
A new method for solving algebraic systems of positive dimension
A zero structure theorem for differential parametric systems
Algorithms for computing triangular decomposition of polynomial systems
An incremental algorithm for computing cylindrical algebraic decompositions
Characteristic set method for differential-difference polynomial systems
Computational schemes for subresultant chains
Computing differential characteristic sets by change of ordering
Computing representations for radicals of finitely generated differential ideals
Computing the real solutions of polynomial systems with the RegularChains library in Maple
scientific article; zbMATH DE number 5722788 (Why is no real title available?)
scientific article; zbMATH DE number 1253976 (Why is no real title available?)
scientific article; zbMATH DE number 1254247 (Why is no real title available?)
scientific article; zbMATH DE number 1263403 (Why is no real title available?)
scientific article; zbMATH DE number 1273649 (Why is no real title available?)
scientific article; zbMATH DE number 622670 (Why is no real title available?)
scientific article; zbMATH DE number 1057759 (Why is no real title available?)
scientific article; zbMATH DE number 1936673 (Why is no real title available?)
scientific article; zbMATH DE number 2151241 (Why is no real title available?)
scientific article; zbMATH DE number 3225844 (Why is no real title available?)
Ideals, Varieties, and Algorithms
Lifting techniques for triangular decompositions
Localization and primary decomposition of polynomial ideals
Modular algorithms for computing Gröbner bases.
On solving parametric polynomial systems
On the affine Bezout inequality
On the theories of triangular sets
Parallelization of triangular decompositions: techniques and implementation
Probabilistic algorithms for computing resultants
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
Solving zero-dimensional algebraic systems
Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case
Triangular decomposition of semi-algebraic systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496596)