A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

This revised and extensively expanded edition of Computability and Complexity Theory
comprises essential materials that are core knowledge in the theory of computation. The …

This thesis is making contributions to three strands of descriptive complexity theory. First, we
adapt a representation-invariant, singly exponential-time graph canonization algorithm of …

We define and study a new notion of “robust simulations” between complexity classes which
is intermediate between the traditional notions of infinitely-often and almost-everywhere, as …

We investigate the question whether NE can be separated from the reduction closures of
tally sets, sparse sets and NP. We show that (1) NE\not⊆R^NP_n^o(1)-T(TALLY);(2) …

Είναι άποψη του συγγραφέα πως οι πτυχιακές εργασίες θα πρέπει να συνεισφέρουν, έστω και
στον ελάχιστο βαθμό, στην εκάστοτε επιστημονική κοινότητα και να μην αποτελούν απλά μια …

We study fragments 3 (k∀) and 3 (k-dep) of dependence logic defined either by restricting
the number k of universal quantifiers or the width of dependence atoms in formulas. We find …

Model expansion is the task underlying many paradigms for declarative solving of
computationally hard search problems such as scheduling, planning, and formal verification …