On the P-NP problem over real matrix rings
From MaRDI portal
Publication:1884926
DOI10.1016/j.tcs.2003.11.022zbMath1070.68045OpenAlexW2069470740MaRDI QIDQ1884926
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.022
Cites Work
- A note on a \(P \neq NP\) result for a restricted class of real machines
- Computing over the reals with addition and order
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- A model-theoretic proof for P ≠ NP over all infinite abelian group
- On digital nondeterminism
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- P ≠ NP for all infinite Boolean algebras
- The P-DNP problem for infinite Abelian groups
