default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Descriptive Complexity and Finite Models 1996
- Neil Immerman, Phokion G. Kolaitis:
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, DIMACS/AMS 1996, ISBN 978-0-8218-0517-6 - Ronald Fagin:
Easier Ways to Win Logical Games. 1-32 - Bruno Courcelle:
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. 33-62 - Howard Straubing:
Finite Models, Automata, and Circuit Complexity. 63-96 - Victor Vianu:
Databases and Finite-Model Theory. 97-148 - Moshe Y. Vardi:
Why is Modal Logic So Robustly Decidable? 149-183 - E. Allen Emerson:
Model Checking and the Mu-calculus. 185-214 - Toniann Pitassi:
Algebraic Propositional Proof Systems. 215-244
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-25 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
