computational complexity

, Volume 7, Issue 3, pp 205–263

A quantifier elimination for the theory of p-adic numbers

  • L. Egidi

DOI: 10.1007/s000370050011

Cite this article as:
Egidi, L. Comput. complex. (1998) 7: 205. doi:10.1007/s000370050011


This paper presents a detailed analysis of a quantifier elimination algorithm for the first order theory of p-adic numbers based on a p-adic analogue of the cylindrical algebraic decomposition. It is believed that this method should lead to an elementary upper bound for the theory. The present paper gives strong arguments against this conjecture and offers a basis for further speculation.

Keywords. Complexity; theory of p-adic numbers; cylindrical algebraic decomposition.

Copyright information

© Birkhäuser Verlag, Basel 1998

Authors and Affiliations

  • L. Egidi
    • 1
  1. 1.Dipartimento di Informatica, Università degli Studi di Torino, Corso Svizzera, 185, I-10149 Torino TO, Italy, e-mail: lavinia@di.unito.itIT