## The Computational Complexity of Some Problems of Linear Algebra

- Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
- Electronic Colloquium on Computational Complexity
- 1997

Highly Influenced

10 Excerpts

@inproceedings{Egidi1993TheCO, title={The Complexity of the Theory of p-adic Numbers}, author={Lavinia Egidi}, booktitle={FOCS}, year={1993} }

- Published in FOCS 1993
DOI:10.1109/SFCS.1993.366846

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