Functions computable with limited access to NP
| Author(s) : | Mitsunori Ogihara, |
| Publisher : | N/A |
| Publication Date : | 1996 |
| ISSN : | N/A |
| Abstract : | It is shown for any constant c 1, that if NPMV have renements in the class of multivalued functions that are polynomial time computable with c(log n) access to NPSV, then the polynomial time hierarchy collapses to its second level. 1, |