Functions computable with limited access to NP

Research output: Contribution to journalArticle

15 Citations (Scopus)

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

Polynomial time
Polynomials
Multivalued Functions
Single valued
Refinement
Query
Hierarchy

Keywords

  • Computational complexity
  • Nondeterministic functions
  • Polynomial hierarchy
  • Reducibility

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Functions computable with limited access to NP. / Ogihara, Mitsunori.

In: Information Processing Letters, Vol. 58, No. 1, 08.04.1996, p. 35-38.

Research output: Contribution to journalArticle

@article{628bff5e47a043b489632f1d0fe6b52c,
title = "Functions computable with limited access to NP",
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.",
keywords = "Computational complexity, Nondeterministic functions, Polynomial hierarchy, Reducibility",
author = "Mitsunori Ogihara",
year = "1996",
month = "4",
day = "8",
doi = "10.1016/0020-0190(96)00030-0",
language = "English (US)",
volume = "58",
pages = "35--38",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Functions computable with limited access to NP

AU - Ogihara, Mitsunori

PY - 1996/4/8

Y1 - 1996/4/8

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Nondeterministic functions

KW - Polynomial hierarchy

KW - Reducibility

UR - http://www.scopus.com/inward/record.url?scp=0002536854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002536854&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(96)00030-0

DO - 10.1016/0020-0190(96)00030-0

M3 - Article

VL - 58

SP - 35

EP - 38

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -