We provide new characterizations of two previously studied questions on nondeterministic
function classes: We show that Q1 for the class NPMVt is equivalent to the question whether …

We study the shrinking and separation properties (two notions well-known in descriptive set
theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions …

The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions
with values that are polynomially verifiable and guaranteed to exist. Do we have evidence …

This paper is motivated by the open question whether the union of two disjoint NP-complete
sets always is NP-complete. We discover that such unions retain much of the complexity of …

This paper investigates the existence of inseparable disjoint pairs of NP languages and
related strong hypotheses in computational complexity. Our main theorem says that, if NP …

The class, defined by Megiddo and Papadimitriou, consists of multivalued functions with
values that are polynomially verifiable and guaranteed to exist. Do we have evidence that …

This paper is motivated by the open question whether the union of two disjoint NP-complete
sets always is NP-complete. We discover that such unions retain much of the complexity of …

Wir untersuchen den Zusammenhang zwischen zwei offenen Vermutungen, SAT und TFNP.
Die Vermutung SAT behauptet, dass es kein p-optimales Beweissystem für SAT gebe …

This thesis is devoted to the study of computational complexity theory, a branch of theoretical
computer science. Computational complexity theory investigates the inherent difficulty in …

The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions
with values that are polynomially verifiable and guaranteed to exist. Do we have evidence …