Functions computable with limited access to NP

Mitsunori Ogihara

doi:10.1016/0020-0190(96)00030-0

Functions computable with limited access to NP

Mitsunori Ogihara

Research output: Contribution to journal › Article

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 language	English (US)
Pages (from-to)	35-38
Number of pages	4
Journal	Information Processing Letters
Volume	58
Issue number	1
DOIs	https://doi.org/10.1016/0020-0190(96)00030-0
State	Published - Apr 8 1996
Externally published	Yes

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

Ogihara, M. (1996). Functions computable with limited access to NP. Information Processing Letters, 58(1), 35-38. https://doi.org/10.1016/0020-0190(96)00030-0

@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 = apr

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

AN - SCOPUS:0002536854

VL - 58

SP - 35

EP - 38

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -

Access to Document

10.1016/0020-0190(96)00030-0