Generic case completeness
classification
💻 cs.CC
cs.LOmath.GR
keywords
genericallynp-completeproblemstronglyboundedcasecompletenessgeneric
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.