Enumeration Complexity: Incremental Time, Delay and Space

TL;DR

This thesis provides an introduction to enumeration problems, emphasizing various complexity measures such as incremental time, delay, and space, highlighting the author's contributions to understanding these aspects.

Contribution

It offers new insights into enumeration complexity, particularly in measuring incremental time, delay, and space, with a focus on the author's specific research contributions.

Findings

Analysis of enumeration complexity measures

Introduction of new complexity bounds

Comparison of different enumeration algorithms

Abstract

This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the field.