research
∙
02/01/2023
Parameterized Complexity of Weighted Team Definability
In this article, we study the complexity of weighted team definability f...
share
research
∙
05/01/2022
Enumeration Classes Defined by Circuits
We refine the complexity landscape for enumeration problems by introduci...
research
∙
06/12/2020
Enumerating Teams in First-Order Team Logics
We start the study of the enumeration complexity of different satisfiabi...
research
∙
05/11/2020
A Logical Characterization of Constant-Depth Circuits over the Reals
In this paper we give an Immerman's Theorem for real-valued computation....
research
∙
02/01/2019
Counting of Teams in First-Order Team Logics
We study descriptive complexity of counting complexity classes in the ra...
research
∙
10/05/2017
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
In this paper we give a characterization of both Boolean and arithmetic ...
research
∙
10/04/2011
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle's Theorem and the logspace v...
research
∙
09/10/2010
