Elsevier

Journal of Complexity

Volume 23, Issue 2, April 2007, Pages 217-224
Journal of Complexity

On the complexity of p-adic basic semi-algebraic sets

https://doi.org/10.1016/j.jco.2006.09.003Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Complexity
p-adic numbers
Basic sets

Cited by (0)

1

Partially supported by PSC-CUNY Research award 65450-00 34.