The Complexity of the Theory of p-adic Numbers

@inproceedings{Egidi1993TheCO,
  title={The Complexity of the Theory of p-adic Numbers},
  author={Lavinia Egidi},
  booktitle={FOCS},
  year={1993}
}
This paper addresses the question of the complexity of the decision problem for the theory Th(Q,) of p-ad ic 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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…