Computational complexity over the \(p\)-adic numbers

DOI10.1006/jcom.1997.0441zbMath0888.68058OpenAlexW1967484175MaRDI QIDQ1368832

Jennifer Whitehead, Michael Maller

Publication date: 13 May 1998

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

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

zbMATH Keywords

computational complexitymodel of computation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

On invariance of degree for certain computations ⋮ On the complexity of \(p\)-adic basic semi-algebraic sets ⋮ On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture ⋮ Calculs sur les structures de langage dénombrable ⋮ Efficient \(p\)-adic cell decompositions for univariate polynomials ⋮ P\(\neq\) NC over the \(p\)-adic numbers

Cites Work

• A note on a theorem of Blum, Shub, and Smale
• On definable subsets of p-adic fields
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity over the \(p\)-adic numbers