ECCC-Report TR96-021https://eccc.weizmann.ac.il/report/1996/021Comments and Revisions published for TR96-021en-usThu, 07 Mar 1996 19:00:44 +0200
Paper TR96-021
| NP-hard Sets Are Superterse unless NP Is Small |
Yongge Wang
https://eccc.weizmann.ac.il/report/1996/021We show that the class of sets which can be polynomial
time truth table reduced to some $p$-superterse sets has
$p$-measure 0. Hence, no $P$-selective set is $\le_{tt}^p$-hard
for $E$. Also we give a partial affirmative answer to
the conjecture by Beigel, Kummer and Stephan. They conjectured
that every $\le_{tt}^p$-hard set for $NP$ is $P$-superterse
unless $P=NP$. We will prove that every $\le_{tt}^p$-hard set
for $NP$ is $P$-superterse unless $NP$ has $p$-measure $0$.
Thu, 07 Mar 1996 19:00:44 +0200https://eccc.weizmann.ac.il/report/1996/021