Quantifier Elimination over Finite Fields Using Gröbner Bases-Reference-Cited by-同舟云学术

Quantifier Elimination over Finite Fields Using Gröbner Bases

Published:2011 Issue: Volume: Page:140-157
ISSN:0302-9743
Container-title:Algebraic Informatics
language:
Short-container-title:

Author:

Gao Sicun,Platzer André,Clarke Edmund M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21493-6_9

Reference17 articles.

1. The SAGE Computer Algebra system, http://sagemath.org

2. The Singular Computer Algebra system, http://www.singular.uni-kl.de/

3. Becker, T., Weispfenning, V.: Gröbner Bases. Springer, Heidelberg (1998)

4. Le Borgne, M., Benveniste, A., Le Guernic, P.: Polynomial dynamical systems over finite fields. In: Algebraic Computing in Control, vol. 165. Springer, Heidelberg (1991)

5. Marchand, H., Le Borgne, M.: On the Optimal Control of Polynomial Dynamical Systems over Z/pZ. In: 4th International Workshop on Discrete Event Systems, pp. 385–390 (1998)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Classifier Construction in Boolean Networks Using Algebraic Methods;Computational Methods in Systems Biology;2020

2. The Number of Gröbner Bases in Finite Fields (Research);Advances in Mathematical Sciences;2020

3. Undecidability and hardness in mixed-integer nonlinear programming;RAIRO - Operations Research;2019-01

4. Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields;VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms;2019

5. Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm;Lecture Notes in Computer Science;2016