Computing canonical representatives of regular differential ideals
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Solving projective complete intersection faster
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
On computer-assisted classification of coupled integrable equations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
On computer-assisted classification of coupled integrable equations
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
An algorithm for isolating the real solutions of semi-algebraic systems
Journal of Symbolic Computation
Decomposing Algebraic Varieties
ADG '98 Proceedings of the Second International Workshop on Automated Deduction in Geometry
Reasoning about Surfaces Using Differential Zero and Ideal Decomposition
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
A New Scheme for Computing with Algebraically Closed Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Real solving for positive dimensional systems
Journal of Symbolic Computation
Computing the topology of real algebraic surfaces
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Computation of canonical forms for ternary cubics
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Degree bounds and lifting techniques for triangular sets
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Algorithms to compute the topology of orientable real algebraic surfaces
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Generalized Reduction in Rings of Differential Polynomials
Programming and Computing Software
Characterizable Radical Differential Ideals and Some Properties of Characteristic Sets
Programming and Computing Software
Sharp estimates for triangular sets
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The RegularChains library in MAPLE
ACM SIGSAM Bulletin
Triangular decompositions of polynomial systems: from theory to practice
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computation of the splitting field of a dihedral polynomial
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
An implementation report for parallel triangular decompositions
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Solving parametric polynomial systems
Journal of Symbolic Computation
On approximate triangular decompositions in dimension zero
Journal of Symbolic Computation
Differential forms in computational algebraic geometry
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Change of order for regular chains in positive dimension
Theoretical Computer Science
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
An Algorithm for Transforming Regular Chain into Normal Chain
Computer Mathematics
Properties of Ascending Chains for Partial Difference Polynomial Systems
Computer Mathematics
A characteristic set method for ordinary difference polynomial systems
Journal of Symbolic Computation
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation
Fast arithmetic for triangular sets: From theory to practice
Journal of Symbolic Computation
Dynamic balancing of planar mechanisms using toric geometry
Journal of Symbolic Computation
On the complexity of counting components of algebraic varieties
Journal of Symbolic Computation
Characteristic set method for differential-difference polynomial systems
Journal of Symbolic Computation
Computing cylindrical algebraic decomposition via triangular decomposition
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computing differential characteristic sets by change of ordering
Journal of Symbolic Computation
Computing with algebraically closed fields
Journal of Symbolic Computation
Some constructions for real algebraic curves
Journal of Symbolic Computation
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case
Computers & Mathematics with Applications
Some notes upon "When does equal sat(T)?"
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Almost linear time operations with triangular sets
ACM Communications in Computer Algebra
The modpn library: Bringing fast polynomial arithmetic into Maple
Journal of Symbolic Computation
Algorithms for computing triangular decompositions of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
On the regularity property of differential polynomials modulo regular differential chains
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Journal of Symbolic Computation
Bit-size estimates for triangular sets in positive dimension
Journal of Complexity
Some properties of triangular sets and improvement upon algorithm charser
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Algorithms for computing triangular decomposition of polynomial systems
Journal of Symbolic Computation
Characteristic set algorithms for equation solving in finite fields
Journal of Symbolic Computation
Algorithmic Thomas decomposition of algebraic and differential systems
Journal of Symbolic Computation
Speeding up cylindrical algebraic decomposition by gröbner bases
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
A new algorithmic scheme for computing characteristic sets
Journal of Symbolic Computation
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
On Fulton's algorithm for computing intersection multiplicities
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
Theoretical Computer Science
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.01 |