P-adic constraint solving

Authors:
Andreas Dolzmann;Thomas Sturm
Affiliations:
Department of Mathematics and Computer Science, University of Passan, Germany;Department of Mathematics and Computer Science, University of Passan, Germany
Venue:
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Year:
1999

The complexity of linear problems in fields

Journal of Symbolic Computation
Algorithmic investigations in p-adic fields

Algorithmic investigations in p-adic fields
Guarded expressions in practice

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Simplification of quantifier-free formulae over ordered fields

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Approaches to parallel quantifier elimination

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Local quantifier elimination

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Solving Geometric Problems with Real Quantifier Elimination

ADG '98 Proceedings of the Second International Workshop on Automated Deduction in Geometry
New domains for applied quantifier elimination

CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Weak integer quantifier elimination beyond the linear case

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing

Hi-index	0.00