# Descriptive complexity theory

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- AAAI
- 2012

In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visualâ€¦Â (More)

Is this relevant?

2010

2010

- Electronic Colloquium on Computational Complexity
- 2010

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L weâ€¦Â (More)

Is this relevant?

2008

2008

- CSL
- 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

- 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

- Discrete Applied Mathematics
- 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

- CSL
- 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

- Graduate Texts in Computer Science
- 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)

Is this relevant?

Review

1998

Review

1998

- Bulletin of Symbolic Logic
- 1998

Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables haveâ€¦Â (More)

Is this relevant?

1996

1996

- Proof Complexity and Feasible Arithmetics
- 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

- STOC
- 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?