eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-04-26
1
5
10.4230/DagSemProc.10061.2
article
10061 Executive Summary – Circuits, Logic, and Games
Rossman, Benjamin
Schwentick, Thomas
Thérien, Denis
Vollmer, Heribert
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10061/DagSemProc.10061.2/DagSemProc.10061.2.pdf
Computational complexity theory
finite model theory
Boolean circuits
regular languages
finite monoids
Ehrenfeucht-Fra\"\i ss\'e-games