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 | |
| State | Published - Apr 8 1996 |
| Externally published | Yes |
Fingerprint
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 journal › Article
}
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 -