Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR08-022 | 9th January 2008 00:00

#### NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly

TR08-022
Authors: Harry Buhrman, John Hitchcock
Publication: 11th March 2008 07:16