The P-DNP problem for infinite Abelian groups
From MaRDI portal
Publication:5949384
DOI10.1006/jcom.2001.0583zbMath0988.68074OpenAlexW2146132580MaRDI QIDQ5949384
Publication date: 30 June 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0583
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
On the P-NP problem over real matrix rings ⋮ \(\mathbf P =\mathbf{NP}\) for some structures over the binary words ⋮ Two situations with unit-cost: ordered abelian semi-groups and some commutative rings ⋮ A topological view on algebraic computation models ⋮ On Relativizations of the P =? NP Question for Several Structures ⋮ Real computational universality: the word problem for a class of groups with infinite presentation
Cites Work
- Unnamed Item
- A note on a \(P \neq NP\) result for a restricted class of real machines
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- On digital nondeterminism
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: The P-DNP problem for infinite Abelian groups
