The P-DNP Problem for Infinite Abelian Groups
- 1 September 2001
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 17 (3) , 574-583
- https://doi.org/10.1006/jcom.2001.0583
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Computability of String Functions Over Algebraic Structures Armin HemmerlingMathematical Logic Quarterly, 1998
- On digital nondeterminismTheory of Computing Systems, 1996
- A note on a P ≠ NP result for a restricted class of real machinesJournal of Complexity, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989