Learn More
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH 3 (k), where BH 3 (k) is the k th level of the Boolean hierarchy over P 2. This is an improvement over the known results 3], which show that the polynomial hierarchy would collapse to P NP NP O(log n)]. This result is signiicant in two ways. First, the(More)
This paper is a study of the existence of polynomial time Boolean connective functions for languages. A languageL has an AND function if there is a polynomial timef such thatf(x,y) εL ⇔x εL andy ε L. L has an OR function if there is a polynomial timeg such thatg(x,y) ε⇔xεL oryεL. While all NP complete sets have these functions, Graph Isomorphism, which is(More)
We study FP NP k , the class of functions that can be computed with nonadaptive queries to an NP oracle. We show that optimization problems stemming from the known NP complete sets, where the optimum is taken over a polynomially bounded range, are hard for FP NP k. This is related to (and, in some sense, extends) work of Chen and Toda CT91]. In addition, it(More)
The Mouse Genome Sequencing Consortium and the RIKEN Genome Exploration Research grouphave generated large sets of sequence data representing the mouse genome and transcriptome, respectively. These data provide a valuable foundation for genomic research. The challenges for the informatics community are how to integrate these data with the ever-expanding(More)
1 About Relativization In this column we explore what relativization says about space bounded computations and what recent results about space bounded computations say about relativization. There is a strong belief in computational complexity circles that problems which can be relativized in two contradictory ways are very hard to solve. We believe that(More)