|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6540
| Title: | Some Comments on Functional Self-Reducibility and the NP Hierarchy |
| Authors: | Borodin, Allan B. Demers, Alan J. |
| Keywords: | computer science technical report |
| Issue Date: | Jul-1976 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-284 |
| Abstract: | In Valiant [11] and Schnorr [9], concepts of "functional self-reducibility" are introduced and investigated. We concentrate on the class NP and on the NP hierarchy of Meyer and Stockmeyer [7] to further investigate these ideas. Assuming that the NP hierarchy exists (specifically, assuming that $P \stackrel{\subset}{+} NP = \sum^{P}_{1} \stackrel{\subset}{+} \sum^{P}_{2}$ we show that, while every complete set in $\sum^{P}_{2}$ is functionally self-reducible, there exist sets in $\sum^{P}_{2}$ which are not functionally self-reducible. |
| URI: | http://hdl.handle.net/1813/6540 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|