39 citations · 46 across the 3 of their papers we have counts for
3 papers
Satisfiability Checking meets Symbolic Computation (Project Paper)
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, impleme…
Deterministically Computing Reduction Numbers of Polynomial Ideals
Amir Hashemi, Michael Schweinfurter, Werner M. Seiler
We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines…
Quasi-Stability versus Genericity
Amir Hashemi, Michael Schweinfurter, Werner M. Seiler
Quasi-stable ideals appear as leading ideals in the theory of Pommaret bases. We show that quasi-stable leading ideals share many of the properties of the generic initial ideal. In…