Easy Sets and Hard Certificate Schemes (1995)
by
Lane A. Hemaspaandra
,
Jörg Rothe
,
Gerd Wechsung
| Citations: | 15 - 4 self |
BibTeX
@MISC{Hemaspaandra95easysets,
author = {Lane A. Hemaspaandra and Jörg Rothe and Gerd Wechsung},
title = {Easy Sets and Hard Certificate Schemes},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for all NP certificate schemes, infinitely often have easy acceptance certificates. We give structural conditions that control the size of these classes.
