A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Upper and Lower Bounds for the Degree of Groebner Bases
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A note on the complexity of constructing Gröbner-Bases
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Simplification of radical expressions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Canonical representatives for residue classes of a polynomial ideal
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Algorithmic aspects of polynomial residue class rings
Algorithmic aspects of polynomial residue class rings
On algorithms for solving systems of polynomial equations
ACM SIGSAM Bulletin
Toward a formal implementation of computer algebra
ACM SIGSAM Bulletin
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
Some properties of Gröbner-bases for polynomial ideals
ACM SIGSAM Bulletin
An improved algorithmic construction of Gröbner-bases for polynomial ideals
ACM SIGSAM Bulletin
A simplified proof of the characterization theorem for Gröbner-bases
ACM SIGSAM Bulletin
Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
Computer Algebra: Past and Future
Journal of Symbolic Computation
Report on a program for solving polynomial equations in non-commuting variables
ACM SIGSAM Bulletin
Admissible term orderings used in computer algebra systems
ACM SIGSAM Bulletin
A p-adic approach to the computation ofGröbner bases
Journal of Symbolic Computation
Non-commutative Gröbner bases in algebras of solvable type
Journal of Symbolic Computation
Journal of Symbolic Computation
Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
Journal of Symbolic Computation
Monomial orderings and Gröbner bases
ACM SIGSAM Bulletin
| Hi-index | 0.00 |