| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430204 | Journal of Computer and System Sciences | 2016 | 15 Pages |
Abstract
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alexei Miasnikov, Alexander Ushakov,