39 citations · 62 across the 10 of their papers we have counts for
13 papers
Certifying Irreducibility in Z[x]
John Abbott
We consider the question of certifying that a polynomial in or is irreducible. Knowing that a polynomial is irreducible lets us recognise that a q…
Ideals modulo a prime
John Abbott, Anna Maria Bigatti, Lorenzo Robbiano
The main focus of this paper is on the problem of relating an ideal in the polynomial ring to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]…
Computing and Using Minimal Polynomials
John Abbott, Anna Maria Bigatti, Elisa Palezzato +1
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular ca…
Groebner Bases for Everyone with CoCoA-5 and CoCoALib
John Abbott, Anna Maria Bigatti
We present a survey on the developments related to Groebner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a "mathematician…
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…
Satisfiability Checking and Symbolic Computation
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of deci…