scientific article; zbMATH DE number 3930347
zbMATH Open0581.68039MaRDI QIDQ3703293FDOQ3703293
Authors: Abdelilah Kandri Rody, Deepak Kapur, Paliath Narendran 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
term rewritinglinear formspolynomial idealsfinitely presented commutative ringpolynomial equivalence problemGröbner basisfinitely presented boolean polynomial ringsunifiers of two forms over a finitely presented abelian group
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Word problems, etc. in computability and recursion theory (03D40) Applications of logic to commutative algebra (13L05)
Cited In (14)
- Conditional congruence closure over uninterpreted and interpreted symbols
- Buchberger's algorithm: The term rewriter's point of view
- On the complexity of Boolean unification
- Complexity of unification problems with associative-commutative operators
- The complexity of equivalence for commutative rings
- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Cancellativity in finitely presented semigroups
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Simulating Buchberger's algorithm by Knuth-Bendix completion
- Solving non-linear Boolean equation systems by variable elimination
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Boolean Gröbner bases
- Incremental column-wise verification of arithmetic circuits using computer algebra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703293)
