On the complexity of p-adic basic semi-algebraic sets
We study the complexity of detecting feasibility of p-adic basic semi-algebraic sets. We construct an algorithm using restricted p-adic precision L, which runs in time polynomial in L, the degrees and number of defining polynomials, and the exponents in the defining Macintyre predicates. (c) 2006 Elsevier Inc. All rights reserved.
complexity p-adic numbers basic sets