## High Sets for NP (1997)

by
Johannes Köbler
,
Uwe Schöning

Venue: | In Advances in Algorithms, Languages, and Complexity |

Citations: | 4 - 2 self |

### BibTeX

@INPROCEEDINGS{Köbler97highsets,

author = {Johannes Köbler and Uwe Schöning},

title = {High Sets for NP},

booktitle = {In Advances in Algorithms, Languages, and Complexity},

year = {1997},

pages = {139--156},

publisher = {Kluwer Academic Publishers}

}

### OpenURL

### Abstract

this paper is a proof that NP-hard