The following pages link to (Q3703293):
Displaying 13 items.
- On the complexity of Boolean unification (Q293360) (← links)
- Boolean Gröbner bases (Q633095) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- Simulating Buchberger's algorithm by Knuth-Bendix completion (Q5055776) (← links)
