Date of Original Version

6-2002

Type

Article

Abstract or Description

In this paper we investigate the following question: if NP is slightly hard on average, is it very hard on average?

The computational result we prove essentially matches an information-theoretic bound

DOI

10.1016/j.jcss.2004.01.001

Share

COinS