论文信息 - Functions Computable with Limited Access to NP

Functions Computable with Limited Access to NP

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.

Mitsunori Ogihara

[1] Timothy J. Long,et al. Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[2] Alan L. Selman,et al. A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[3] Lane A. Hemaspaandra,et al. Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1994, SIAM J. Comput..

[4] Mitsunori Ogihara,et al. On Using Oracles That Compute Values , 1993, STACS.

[5] Harry Buhrman,et al. Functions Computable with Nonadaptive Queries to NP , 1998, Theory of Computing Systems.