License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25279
URL: http://drops.dagstuhl.de/opus/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:
Document 1.pdf (186 KB)


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:DSP:2010:2527,
  author =	{Benjamin Rossman and Thomas Schwentick and Denis Th{\'e}rien and Heribert Vollmer},
  title =	{10061 Executive Summary -- Circuits, Logic, and Games},
  booktitle =	{Circuits, Logic, and Games},
  year =	{2010},
  editor =	{Benjamin Rossman and Thomas Schwentick and Denis Th{\'e}rien and Heribert Vollmer},
  number =	{10061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2527},
  annote =	{Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\"\i ss\'e-games}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI