DagSemProc.10061.2.pdf
- Filesize: 186 kB
- 5 pages
Document
10061 Executive Summary – Circuits, Logic, and Games
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 10061
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-04-26
Cite AsGet 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
https://doi.org/10.4230/DagSemProc.10061.2
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.
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)
0PDF Downloads