A quantifier elimination for the theory of \(p\)-adic numbers

DOI10.1007/S000370050011zbMath0922.11108OpenAlexW2006885630MaRDI QIDQ1277096

Lavinia Egidi

Publication date: 20 July 1999

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050011

zbMATH Keywords

complexityquantifier elimination\(p\)-adic numbersupper bound for decision problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability (number-theoretic aspects) (11U05) Model-theoretic algebra (03C60) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (1)

The computational complexity of some problems of linear algebra

This page was built for publication: A quantifier elimination for the theory of \(p\)-adic numbers