Generic case completeness
Computational Complexity
2016-06-06 v1 Logic in Computer Science
Group Theory
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
Cite
@article{arxiv.1606.01172,
title = {Generic case completeness},
author = {Alexei Miasnikov and Alexander Ushakov},
journal= {arXiv preprint arXiv:1606.01172},
year = {2016}
}