Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart
of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of …

We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains
a complete pair. The question relates to the question of whether optimal proof systems exist …

Propositional Satisfiability (SAT) solvers are routinely used for solving many function
problems. A natural question that has seldom been addressed is: what is the number of calls …

In Part I of this series of papers, we developed a language called Agent Programs for
defining the operational behavior of software agents and defined a set of successively more …

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 …

The class NPkV consists of those partial, multivalued functions that can be computed by a
nondeterministic, polynomial time-bounded transducer that has at most k distinct values on …

Computational complexity theory usually investigates the complexity of sets, ie, the
complexity of partitions into two parts. But often it is more appropriate to represent natural …

We study the class coNPMV of complements of NPMV functions. Though defined
symmetrically to NPMV this class exhibits very different properties. We clarify the complexity …

In this note, the problem of determining disjoint matchings in a set of intervals is investigated
(two intervals can be matched if they are disjoint). Such problems find applications in …

The boolean hierarchy of k-partitions over NP for k≥ 3 was introduced as a generalization of
the well-known boolean hierarchy of sets (2-partitions). The classes of this hierarchy are …