2026-07-24T01:59:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2527 2024-03-06T11:09:08Z ddc:004 open_access

10061 Executive Summary – Circuits, Logic, and Games Rossman, Benjamin Schwentick, Thomas Thérien, Denis Vollmer, Heribert Computational complexity theory finite model theory Boolean circuits regular languages finite monoids Ehrenfeucht-Fra\"\i ss\'e-games 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Rossman and Thomas Schwentick and Denis Thérien and Heribert Vollmer 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.10061.2 urn:nbn:de:0030-drops-25279 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.2 eng https://creativecommons.org/licenses/by/4.0/legalcode