On invariance of degree for certain computations

DOI10.1016/j.jco.2003.11.007zbMath1161.68478OpenAlexW1964117185MaRDI QIDQ876819

Michael Maller

Publication date: 30 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.jco.2003.11.007

zbMATH Keywords

BSS machinescontinuous computational complexity

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Computational complexity over the \(p\)-adic numbers
• P\(\neq\) NC over the \(p\)-adic numbers
• On definable subsets of p-adic fields
• Lower Bounds in a Parallel Model without Bit Operations
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: On invariance of degree for certain computations