Efficient \(p\)-adic cell decompositions for univariate polynomials

DOI10.1006/jcom.1999.0520zbMath0962.11039OpenAlexW1979747255MaRDI QIDQ1578508

Jennifer Whitehead, Michael Maller

Publication date: 3 September 2000

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

Full work available at URL: https://doi.org/10.1006/jcom.1999.0520

zbMATH Keywords

polynomial-time algorithm\(p\)-adic numberscell decompositionsCohen cells

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Other analytic theory (analogues of beta and gamma functions, (p)-adic integration, etc.) (11S80) Polynomials (11S05)

Related Items (2)

On the complexity of \(p\)-adic basic semi-algebraic sets ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity over the \(p\)-adic numbers
• An inequality for the discriminant of a polynomial
• Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
• p-adic semi-algebraic sets and cell decomposition.
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Decision procedures for real and p‐adic fields

This page was built for publication: Efficient \(p\)-adic cell decompositions for univariate polynomials