This book is an accessible introduction to complexity theory and cryptology, two closely
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …

A narrative review is used to develop a theoretical evidence-based means-end framework to
build an epistemic foundation to uphold explainable artificial intelligence instruments so that …

We address the question of whether two multiplayer strategic games are equivalent and the
computational complexity of deciding such a property. We introduce two notions of …

To determine if two lists of numbers are the same set, we sort both lists and see if we get the
same result. The sorted list is a canonical form for the equivalence relation of set equality …

A Boolean constraint satisfaction instance is a set of constraint applications where the
allowed constraints are drawn from a fixed set C of Boolean functions. We consider the …

We investigate the complexity of finding prime implicants and minimum equivalent DNFs for
Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For …

This thesis studies some of the ways in which symmetries and equivalence relations arise in
classical and geometric complexity theory. The Geometric Complexity Theory program is …

In the last 40 years, complexity theory has grown to a rich and powerful field in theoretical
computer science. The main task of complexity theory is the classification of problems with …

We consider the question of when two games are equivalent and the computational
complexity of deciding such a property for strategic games. We introduce three types of …

More than a quarter of a century ago, the question of the complexity of determining whether
a given Boolean formula is minimal motivated Meyer and Stockmeyer to define the …