P\(\neq\) NC over the \(p\)-adic numbers

DOI10.1016/S0885-064X(02)00002-XzbMath1012.68077MaRDI QIDQ1869961

Michael Maller, Jennifer Whitehead

Publication date: 4 May 2003

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

zbMATH Keywords

Blum-Shub-Smale model of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

On invariance of degree for certain computations

Cites Work

• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Computational complexity over the \(p\)-adic numbers
• On definable subsets of p-adic fields
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: P\(\neq\) NC over the \(p\)-adic numbers