Mitsunori Ogiwara

On polynomial-time bounded truth-table reducibility of NP sets to sparse sets

It is proved that if

A complexity theory for feasible closure properties

{\text{P}} \ne {\text{NP}}

How hard are sparse sets

, then there exists a set in

A Relationship between Difference Hierarchies and Relativized Polynomial Hierarchies.

{\text{NP}}

On one query, self-reducible sets

that is not polynomial-time bounded truth-table reducible (in short,

P-selective sets, and reducing search to decision vs. self-reducibility

\leqq _{{\text{btt}}}^{\text{P}}

Counting classes are at least as hard as the polynomial-time hierarchy

-reducible) to any sparse set. In other words, it is proved that no sparse

On sparse hard sets for counting classes

\leqq _{{\text{btt}}}^{\text{P}}

On polynomial time bounded truth-table reducibility of NP sets to sparse sets

-hard set exists for

On Using Oracles That Compute Values

{\text{NP}}