P-adic constraint solving

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

P-adic constraint solving

Full text

Pdf (779 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1999 international symposium on Symbolic and algebraic computation table of contents

Vancouver, British Columbia, Canada

Pages: 151 - 158

Year of Publication: 1999

ISBN:1-58113-073-2

Authors

Andreas Dolzmann	Department of Mathematics and Computer Science, University of Passan, Germany
Thomas Sturm	Department of Mathematics and Computer Science, University of Passan, Germany

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/309831.309894 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ax. J., AND KOCHEN, S. Diophantine problems over local fields. Annals of Mathematics 83 (1966), 437 456. Part III.
	2	COHEN. P. J. Decision procedures for real and p-adic fields. Communications in Pure and Applied Logic 25 (1969), 213-231.
	3	Andreas Dolzmann , Oliver Gloor , Thomas Sturm, Approaches to parallel quantifier elimination, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.88-95, August 13-15, 1998, Rostock, Germany [doi>10.1145/281508.281564]
	4	Andreas Dolzmann , Thomas Sturm, Guarded expressions in practice, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.376-383, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258851]
	5	Andreas Dolzmann , Thomas Sturn, REDLOG: computer algebra meets computer logic, ACM SIGSAM Bulletin, v.31 n.2, p.2-9, June 1997 [doi>10.1145/261320.261324]
	6	Andreas Dolzmann , Thomas Sturm, Simplification of quantifier-free formulae over ordered fields, Journal of Symbolic Computation, v.24 n.2, p.209-231, August 1997 [doi>10.1006/jsco.1997.0123]
	7	DOLZMANN, A., STURM, T., AND WEISPFENNING, V. Real quantifier elimination in practice. In Algorithmic Algebra and Number Theory, B. H. Matzat, G.- M. Greuel, and G. Hiss, Eds. Springer, Berlin, 1998, pp. 221-247.
	8	Devdatt Padmakar Dubhashi, Algorithmic investigations in p-adic fields, Cornell University, Ithaca, NY, 1992
	9	ERSHOV, J. L. On elementary theories of local fields. Algebra i Logika Sern. 4, 2 (1965), 5-30.
	10	FERRANTE, J., AND RACKOFF, C. W. The Computational Complexity of Logical Theories. No. 718 in Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1979.
	11	MACINTYRE, A. On definable subsets of p-adic fields. Journal of Symbolic Logic 41, 3 (Sept. 1976), 605-610.
	12	OSTROWSKI, A. ~ber einige L~sungen der Funktionalgleichung (x). (y) = (xy). Acta Mathematica 41 (1918), 271-284.
	13	STURM, T. Linear problems in valued fields. Technical Report MIP-9715, FMI, Universit~t Passau, D-94030 Passau, Germany, Nov. 1998.
	14	WEISPFENNING, V. Quantifier elimination and decision procedures for valued fields. In Models and Sets (Aachen, 1983), G. H. M~ller and M. M. Richter, Eds., vol. 1103 of Lecture Notes in Mathematics. Springer- Verlag, Berlin, Heidelberg, 1984, pp. 419 472.
	15	Volker Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, v.5 n.1-2, p.3-27, February/April 1988 [doi>10.1016/S0747-7171(88)80003-8]