Descriptive complexity theory

Known as: Descriptional complexity, Descriptive complexity 
Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we… (More)
  • figure 1
Is this relevant?
2008
2008
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is… (More)
Is this relevant?
Review
2003
Review
2003
In this article we review some of the main results of descriptive complexity theory in order to make the reader familiar with the… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is de nable in… (More)
Is this relevant?
1999
1999
We consider the data complexity of various logics on two important classes of constraint databases: dense order and linear… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… (More)
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Is this relevant?
Review
1998
Review
1998
Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1996
1996
The classes W [t] of the Downey-Fellows W hierarchy are defined, for each t, by fixed-parameter reductions to the weighted… (More)
Is this relevant?
1995
1995
We present a logical approach to complexity over the real numbers with respect to the model of Blum, Shub and Smale. The Iogics… (More)
Is this relevant?