It turns out that some of the languages investigated for the succinct representation of the instances of combinatorial problems are not comparable, unless P=NP Some problems left open in [2].Expand

The Boolean hierarchy is generalized in such a way that it is possible to characterize P and O in terms of the generalization, and the class $P^{\text{NP}}[O(\log n)]$ can be characterized in very different ways.Expand

The problem of testing membership in the subset of the natural numbers produced at the output gate of a combinational circuit is shown to capture a wide range of complexity classes, and results extend in nontrivial ways past work by Stockmeyer and Meyer, Wagner, Wagner and Yang.Expand

The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels.Expand

Definition de deux hierarchies des classes de complexite. Localisation de la hierarchie de differences et de la hierarchie du tableau de verite pour NP. Exemples d'ensembles complets dans les deuxâ€¦ Expand

[] Proceedings of the Eigth Annual Structure inâ€¦

18 May 1993

TLDR

The question of how complex a leaf language must be in order to characterize some given class C is investigated, which leads to the examination of the closure of different language classes under bit-reducibility.Expand