9 citations · 9 across the 4 of their papers we have counts for
3 papers · 1 filter
Some algebraic and geometric computations in CH via Chow forms
Robert Andrews, Abhibhav Garg, Rafael Oliveira +1
The problem of decomposing an algebraic variety into more structured components (such as equidimensional, irreducible, or connected components) is a fundamental problem in computer…
Hilbert's Nullstellensatz is in the Counting Hierarchy
Robert Andrews, Abhibhav Garg, Éric Schost
We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, li…
Faster modular composition using two relation matrices
Vincent Neiger, Bruno Salvy, Éric Schost +1
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem…