Document Open Access Logo

10061 Executive Summary – Circuits, Logic, and Games

Authors Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer

PDF

File

Thumbnail PDF
PDF
DagSemProc.10061.2.pdf
  • Filesize: 186 kB
  • 5 pages

Document Identifiers

Subject Classification

Keywords
  • Computational complexity theory
  • finite model theory
  • Boolean circuits
  • regular languages
  • finite monoids
  • Ehrenfeucht-Fra\"\i ss\'e-games

Metrics

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

Abstract

In the same way as during the first seminar on "Circuits, Logic, and Games"(Nov.~2006, 06451), the organizers aimed to bring together researchers from the areas of finite model theory and computational complexity theory, since they felt that perhaps not all developments in circuit theory and in logic had been explored fully in the context of lower bounds. In fact, the interaction between
the areas has flourished a lot in the past 2-3 years, as can be exemplified by the following lines
of research.

Cite As Get BibTex

Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 10061 Executive Summary – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/DagSemProc.10061.2

Author Details

Benjamin Rossman
Thomas Schwentick
Denis Thérien
Heribert Vollmer
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