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 |
Keywords
- Computational complexity
- Nondeterministic functions
- Polynomial hierarchy
- Reducibility
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications