The following pages link to (Q3957939):
Displaying 31 items.
- Algebraic simplification and cryptographic motives. (Q291221) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Compatibility of systems of super differential equations (Q913323) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- n-level rewriting systems (Q1084855) (← links)
- Computer algebra: Past and future (Q1098287) (← 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)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Lifting canonical algorithms from a ring R to the ring R[x] (Q1121016) (← links)
- Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases) (Q1126540) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Normal forms for a class of formulas (Q1186734) (← links)
- An algorithm for solving parametric linear systems (Q1194335) (← links)
- An approach to the zero recognition problem by Buchberger algorithm (Q1199821) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- A computational method for determining strong stabilizability of \(n\)-D systems (Q1300577) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Some categories associated with bases of the Kalman algebra (Q1762279) (← links)
- On the descriptive power of term rewriting systems (Q1819932) (← links)
- Ideal basis and primary decompositions: case of two variables (Q1821556) (← links)
- Computations in differential and difference modules (Q1822959) (← links)
- A general framework for Noetherian well ordered polynomial reductions (Q2000264) (← links)
- The replenishment algorithm in algebras of sets (Q2058702) (← links)
- Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory (Q2221497) (← links)
- A separation bound for real algebraic expressions (Q2391181) (← links)
- Automated simplification of large symbolic expressions (Q2437298) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
