Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 06451 Abstracts Collection – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schwentick_et_al:DagSemProc.06451.1, author = {Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{06451 Abstracts Collection – Circuits, Logic, and Games }}, booktitle = {Circuits, Logic, and Games}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.1}, URN = {urn:nbn:de:0030-drops-9785}, doi = {10.4230/DagSemProc.06451.1}, annote = {Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\backslash"\{\backslashi\}ss\backslash'\{e\} games} }
Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 06451 Executive Summary – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schwentick_et_al:DagSemProc.06451.2, author = {Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{06451 Executive Summary – Circuits, Logic, and Games }}, booktitle = {Circuits, Logic, and Games}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.2}, URN = {urn:nbn:de:0030-drops-9774}, doi = {10.4230/DagSemProc.06451.2}, annote = {Keywords: Circuits, Logics, Games} }
Uwe Schöning and Jacobo Torán. A note on the size of Craig Interpolants. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schoning_et_al:DagSemProc.06451.3, author = {Sch\"{o}ning, Uwe and Tor\'{a}n, Jacobo}, title = {{A note on the size of Craig Interpolants}}, booktitle = {Circuits, Logic, and Games}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.3}, URN = {urn:nbn:de:0030-drops-9735}, doi = {10.4230/DagSemProc.06451.3}, annote = {Keywords: Interpolant, non-uniform complexity} }
Arnaud Durand, Clemens Lautemann, and Malika More. Counting Results in Weak Formalisms. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{durand_et_al:DagSemProc.06451.4, author = {Durand, Arnaud and Lautemann, Clemens and More, Malika}, title = {{Counting Results in Weak Formalisms}}, booktitle = {Circuits, Logic, and Games}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.4}, URN = {urn:nbn:de:0030-drops-9767}, doi = {10.4230/DagSemProc.06451.4}, annote = {Keywords: Small complexity classes, logic, polylog counting} }
William Hesse. Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{hesse:DagSemProc.06451.5, author = {Hesse, William}, title = {{Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures}}, booktitle = {Circuits, Logic, and Games}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.5}, URN = {urn:nbn:de:0030-drops-9749}, doi = {10.4230/DagSemProc.06451.5}, annote = {Keywords: Boolean Functions, auxiliary data, circuit complexity, lower bounds} }
Philipp Weis and Neil Immerman. Structure Theorem and Strict Alternation Hierarchy for FOÃ‚Â² on Words. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{weis_et_al:DagSemProc.06451.6, author = {Weis, Philipp and Immerman, Neil}, title = {{Structure Theorem and Strict Alternation Hierarchy for FO\~{A}‚\^{A}² on Words}}, booktitle = {Circuits, Logic, and Games}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6451}, editor = {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/entities/document/10.4230/DagSemProc.06451.6}, URN = {urn:nbn:de:0030-drops-9751}, doi = {10.4230/DagSemProc.06451.6}, annote = {Keywords: Descriptive complexity, finite model theory, alternation hierarchy, Ehrenfeucht-Fraisse games} }
Feedback for Dagstuhl Publishing