Functions computable with limited access to NP

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

It is shown for any constant c < 1 that NP multi-valued functions do not have refinements computable in polynomial time with c log n functional oracle queries to single-valued NP functions unless the polynomial-time hierarchy collapses to its second level.

Original languageEnglish (US)
Pages (from-to)35-38
Number of pages4
JournalInformation Processing Letters
Volume58
Issue number1
DOIs
StatePublished - Apr 8 1996
Externally publishedYes

    Fingerprint

Keywords

  • Computational complexity
  • Nondeterministic functions
  • Polynomial hierarchy
  • Reducibility

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this