The complexity of linear problems in fields
Journal of Symbolic Computation
Well … it isn't quite that simple
ACM SIGSAM Bulletin
Journal of Symbolic Computation
Quantifier elimination for real algebra—the cubic case
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
On the implementation of dynamic evaluation
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Dynamic evaluation and real closure
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Simplification of quantifier-free formulae over ordered fields
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Algebraic Simplification of Multiple-Valued Functions
DISCO '92 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A New Approach for Automatic Theorem Proving in Real Geometry
Journal of Automated Reasoning
Computer algebra handbook
A reconstruction and extension of Maple's assume facility via constraint contextual rewriting
Journal of Symbolic Computation
When can we detect that a P-finite sequence is positive?
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Termination conditions for positivity proving procedures
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |