Document Open Access Logo

Structure and Specification as Sources of Complexity

Author Anuj Dawar

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2009.2336.pdf
  • Filesize: 190 kB
  • 10 pages

Document Identifiers

Subject Classification

Keywords
  • Computational Complexity
  • Descriptive Complexity
  • Logical Complexity
  • Parametrized Complexity
  • Locality
  • Automata

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

If computational complexity is the study of what makes certain computational
problems inherently difficult to solve, an important contribution of
descriptive complexity in this regard is the separation it provides between
the specification of a decision problem and the structure against which this
specification is checked.  The formalisation of these two aspects leads to
tools for studying them as sources of complexity, and on the one hand leads to
results in the characterisation of complexity classes and on the other elates
to parameterized complexity.  In these notes accompanying the invited talk,
some definitions and results are presented leading to recent work on the
characterisation of polynomial time and on the parameterized complexity of
first-order logic on restricted graph classes.

Cite As Get BibTex

Anuj Dawar. Structure and Specification as Sources of Complexity. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 407-416, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2336

Author Details

Anuj Dawar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact