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

Authors:
Michael Maller;Jennifer Whitehead
Affiliations:
Department of Mathematics, Queens College, Flushing, NY 11367, USA;Department of Computer Science, Queens College, Flushing, NY 11367, USA
Venue:
Journal of Complexity
Year:
2007

Citing 5
Cited 0

The complexity of elementary algebra and geometry

Journal of Computer and System Sciences
Computational complexity over the p-adic numbers

Journal of Complexity
Complexity and real computation

Complexity and real computation
Efficient p-adic cell decompositions for univariate polynomials

Journal of Complexity
Machines and complexity over thep-adic numbers

Machines and complexity over thep-adic numbers

Quantified Score

Hi-index	0.00

Visualization

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.