Past, present, and future of quantifier elimination procedures in system theory
暂无分享,去创建一个
[1] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[2] A. Seidenberg. A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .
[3] George E. Collins,et al. Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..
[4] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[5] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[6] N. Bose,et al. Implementation of a new stability test for n-D filters , 1979 .
[7] Franz Winkler,et al. Polynomial Algorithms in Computer Algebra , 1996, Texts and Monographs in Symbolic Computation.
[8] B. Anderson,et al. Output feedback stabilization and related problems-solution via decision methods , 1975 .
[9] E. Jury,et al. Positivity and stability tests for multidimensional filters (discrete-continuous) , 1974 .
[10] James H. Davenport,et al. Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..
[11] Inequalities of Higher Degree in One Unknown , 1947 .
[12] N. Jacobson. Lectures In Abstract Algebra , 1951 .
[13] N. Bose,et al. General procedure for multivariable polynomial positivity test with control applications , 1976 .
[14] Bud Mishra,et al. Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.