Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Some Comments on Functional Self-Reducibility and the NP Hierarchy

Some Comments on Functional Self-Reducibility and the NP Hierarchy

File(s)
76-284.ps (224.79 KB)
76-284.pdf (652.9 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6540
Collections
Computer Science Technical Reports
Author
Borodin, Allan B.
Demers, Alan J.
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.

Date Issued
1976-07
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-284
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance