@inproceedings{d6495854b20b4084bcb5fc77d22659be,
title = "Complexity of the theory of p-adic numbers",
abstract = "This paper addresses the question of the complexity of the decision problem for the theory Th(Qp) of p-adic numbers. The best known lower bound for the theory is double exponential alternating time with a linear number of alternations. I have designed an algorithm that determines the truth value of sentences of the theory requiring double exponential space. My algorithm is based on techniques used by Collins for the theory Th(R) of the reals, and on Denef's work on semi-algebraic sets and cell decomposition for p-adic fields. No elementary upper bound had been previously established.",
author = "Lavinia Egidi",
year = "1993",
language = "English",
isbn = "0818643706",
series = "Annual Symposium on Foundatons of Computer Science (Proceedings)",
publisher = "Publ by IEEE",
pages = "412--421",
editor = "Anon",
booktitle = "Annual Symposium on Foundatons of Computer Science (Proceedings)",
note = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science ; Conference date: 03-11-1993 Through 05-11-1993",
}