Descriptive Complexity, Lower Bounds and Linear Time

  • Thomas Schwentick
Conference paper

DOI: 10.1007/10703163_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1584)
Cite this paper as:
Schwentick T. (1999) Descriptive Complexity, Lower Bounds and Linear Time. In: Gottlob G., Grandjean E., Seyr K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg

Abstract

This paper surveys two related lines of research:
  • Logical characterizations of (non-deterministic) linear time complexity classes, and

  • non-expressibility results concerning sublogics of existential second-order logic.

Starting from Fagin’s fundamental work there has been steady progress in both fields with the effect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of logics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Thomas Schwentick
    • 1
  1. 1.Johannes Gutenberg-Universität Mainz 

Personalised recommendations