arXiv Open Access 2016

Generic case completeness

Alexei Miasnikov Alexander Ushakov

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC cs.LO math.GR

Penulis (2)

Alexei Miasnikov

Alexander Ushakov

Format Sitasi

APA MLA BibTeX

Miasnikov, A., Ushakov, A. (2016). Generic case completeness. https://arxiv.org/abs/1606.01172

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓