### Abstract

For various polynomial-time reducibilities r, the authors ask whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distinguishing equivalence and reducibility to sparse sets, for many-one or 1-truth-table reductions, would imply that P ≠ NP, the authors show that for k-truth-table reductions, k ≥ 2, equivalence and reducibility to sparse sets provably differ. Though R. Gavaldaand D. Watanabe have shown that, for any polynomial-time computable unbounded function f(·), some sets f(n)-truth-table reducible to sparse sets are not even Turing equivalent to sparse sets, the authors show that extending their result to the 2-truth-table case would provide a proof that P ≠ NP. Additionally, the authors study the relative power of different notions of reducibility and show that disjunctive and conjunctive truth-table reductions to sparse sets are surprisingly powerful, refuting a conjecture of K. Ko (1989).

Original language | English (US) |
---|---|

Title of host publication | Proc 6 Annu Struct Complexity Theor |

Publisher | Publ by IEEE |

Pages | 220-229 |

Number of pages | 10 |

ISBN (Print) | 0818622555, 9780818622557 |

State | Published - Dec 1 1991 |

Externally published | Yes |

Event | Proceedings of the 6th Annual Structure in Complexity Theory Conference - Chicago, IL, USA Duration: Jun 30 1991 → Jul 3 1991 |

### Publication series

Name | Proceedings of the Sixth Annual Structure in Complexity Theory Conference |
---|

### Other

Other | Proceedings of the 6th Annual Structure in Complexity Theory Conference |
---|---|

City | Chicago, IL, USA |

Period | 6/30/91 → 7/3/91 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'Relating equivalence and reducibility to sparse sets'. Together they form a unique fingerprint.

## Cite this

*Proc 6 Annu Struct Complexity Theor*(pp. 220-229). (Proceedings of the Sixth Annual Structure in Complexity Theory Conference). Publ by IEEE.