A note on a P ≠ NP result for a restricted class of real machines
Journal of Complexity
Reductions to sets of low information content
Complexity theory
Separation of complexity classes in Koiran's weak model
Selected papers of the workshop on Continuous algorithms and complexity
Complexity and real computation
Complexity and real computation
Information Processing Letters
Sparse NP-complete problems over the reals with addition
Theoretical Computer Science
A weak version of the Blum, Shub and Smale model
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we prove that, in the context of weak machines over R, there are no sparse NP-hard sets.