Abstract
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gröbner 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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Gao, S., Platzer, A., & Clarke, E. M. (2011). Quantifier elimination over finite fields using Gröbner bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6742 LNCS, pp. 140–157). https://doi.org/10.1007/978-3-642-21493-6_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
