Details
Original language | English |
---|---|
Journal | Dagstuhl Seminar Proceedings |
Volume | 10061 |
Publication status | Published - 2010 |
Event | Dagstuhl Seminar: Circuits, Logic, and Games 2010 - Wadern, Germany Duration: 7 Feb 2010 → 12 Feb 2010 |
Keywords
- Boolean circuits, computational complexity theory, Ehrenfeucht-Fraïssé-games, finite model theory, finite monoids, regular languages
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Hardware and Architecture
- Engineering(all)
- Control and Systems Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Dagstuhl Seminar Proceedings, Vol. 10061, 2010.
Research output: Contribution to journal › Conference article › Research › peer review
}
TY - JOUR
T1 - Circuits, Logic, and Games
AU - Rossman, Benjamin
AU - Schwentick, Thomas
AU - Thérien, Denis
AU - Vollmer, Heribert
PY - 2010
Y1 - 2010
KW - Boolean circuits
KW - computational complexity theory
KW - Ehrenfeucht-Fraïssé-games
KW - finite model theory
KW - finite monoids
KW - regular languages
UR - http://www.scopus.com/inward/record.url?scp=85175090804&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85175090804
VL - 10061
JO - Dagstuhl Seminar Proceedings
JF - Dagstuhl Seminar Proceedings
SN - 1862-4405
T2 - Dagstuhl Seminar: Circuits, Logic, and Games 2010
Y2 - 7 February 2010 through 12 February 2010
ER -