Quantifier Elimination over Finite Fields Using Gr\"obner Bases
classification
💻 cs.SC
cs.LO
keywords
algorithmeliminationfinitefieldsobnerquantifieralgebraicanalysis
read the original abstract
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complexity of the algorithm and show its application in the formal analysis of a biological controller model.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.