K
Klaus W. Wagner
Researcher at Augsburg College
Publications - 27
Citations - 1815
Klaus W. Wagner is an academic researcher from Augsburg College. The author has contributed to research in topics: Complexity class & Time complexity. The author has an hindex of 16, co-authored 27 publications receiving 1763 citations. Previous affiliations of Klaus W. Wagner include University of Passau & University of Augsburg.
Papers
More filters
Journal ArticleDOI
Bounded query classes
TL;DR: 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.
Journal ArticleDOI
The complexity of combinatorial problems with succinct input representation
TL;DR: 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].
Journal ArticleDOI
The Boolean hierarchy I: structural properties
Jin-Yi Cai,Thomas Gundermann,Juris Hartmanis,Lane A. Hemachandra,Vivian Sewelson,Klaus W. Wagner,Gerd Wechsung +6 more
TL;DR: 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.
Journal ArticleDOI
More complicated questions about maxima and minima, and some closures of NP
TL;DR: It is shown that problems defined by more complicated questions about maxima and minima are complete in certain subclasses of the Boolean closure of NP and other classes in the interesting area below the class Δ p 2 of the polynomial-time hierarchy.
Journal ArticleDOI
The difference and truth-table hierarchies for NP
TL;DR: Definition de deux hierarchies des classes de complexite, localisation de la hierarchie de differences et de the hierarchie du tableau de verite pour NP.