scientific article

zbMath0581.68039MaRDI QIDQ3703293

Paliath Narendran, Abdelilah Kandri Rody, Deepak Kapur

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Gröbner basislinear formspolynomial idealsterm rewritingfinitely presented commutative ringpolynomial equivalence problemfinitely presented boolean polynomial ringsunifiers of two forms over a finitely presented abelian group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Applications of logic to commutative algebra (13L05) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Word problems, etc. in computability and recursion theory (03D40)

Related Items

On the complexity of Boolean unification, Simulating Buchberger's algorithm by Knuth-Bendix completion, Buchberger's algorithm: The term rewriter's point of view, History and basic features of the critical-pair/completion procedure, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, Boolean Gröbner bases, Incremental column-wise verification of arithmetic circuits using computer algebra, Conditional congruence closure over uninterpreted and interpreted symbols, Complexity of unification problems with associative-commutative operators, Solving non-linear Boolean equation systems by variable elimination, The complexity of equivalence for commutative rings, Cancellativity in finitely presented semigroups, Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols