The complexity of linear problems in fields
Journal of Symbolic Computation
Algebraic computation, numerical computation and verified inclusions
Trends in computer algebra
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
Quantifier elimination for formulas constrained by quadratic equations
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Algebraic numbers: an example of dynamic evaluation
Journal of Symbolic Computation
Applying quantifier elimination to the Birkhoff interpolation problem
Journal of Symbolic Computation
Simulation and optimization by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
About a New Method for Computing in Algebraic Number Fields
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Solution formula construction for truth invariant cad's
Solution formula construction for truth invariant cad's
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Efficient projection orders for CAD
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The Maple package SyNRAC and its application to robust control design
Future Generation Computer Systems
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Theoretical Computer Science
Computing rational solutions of linear matrix inequalities
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.01 |
Recently quantifier elimination (QE) has been of great interest in many fields of science and engineering. In this paper an effective symbolic-numeric cylindrical algebraic decomposition (SNCAD) algorithm and its variant specially designed for QE are proposed based on the authors' previous work and our implementation of those is reported. Based on analysing experimental performances, we are improving our design/synthesis of the SNCAD for its practical realization with existing efficient computational techniques and several newly introduced ones. The practicality of the SNCAD is now examined by a number of experimental results including practical engineering problems, which also reveals the quality of the implementation.