39 citations · 46 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2016★ 39 cited
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…
cs.SC2012★ 7 cited
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…