License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10061.2
URN: urn:nbn:de:0030-drops-25279
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2527/
Go to the corresponding Portal

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

10061 Executive Summary -- Circuits, Logic, and Games

pdf-format:
10061.executive_summary.2527.pdf (0.2 MB)

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.

BibTeX - Entry

@InProceedings{rossman_et_al:DagSemProc.10061.2,
  author =	{Rossman, Benjamin and Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert},
  title =	{{10061 Executive Summary – Circuits, Logic, and Games}},
  booktitle =	{Circuits, Logic, and Games},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10061},
  editor =	{Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2527},
  URN =		{urn:nbn:de:0030-drops-25279},
  doi =		{10.4230/DagSemProc.10061.2},
  annote =	{Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\backslash"\backslashi ss\backslash'e-games}
}

Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\"\i ss\'e-games
Collection: 10061 - Circuits, Logic, and Games
Issue Date: 2010
Date of publication: 26.04.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI