Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDIMACS 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 0-8218-0517-7- Bruno Courcelle:
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. Descriptive Complexity and Finite Models 1996: 33-62 - Howard Straubing:
Finite Models, Automata, and Circuit Complexity. Descriptive Complexity and Finite Models 1996: 63-96 - Victor Vianu:
Databases and Finite-Model Theory. Descriptive Complexity and Finite Models 1996: 97-148 - Moshe Y. Vardi:
Why is Modal Logic So Robustly Decidable? Descriptive Complexity and Finite Models 1996: 149-184 - E. Allen Emerson:
Model Checking and the Mu-calculus. Descriptive Complexity and Finite Models 1996: 185-214 - Toniann Pitassi:
Algebraic Propositional Proof Systems. Descriptive Complexity and Finite Models 1996: 215-244
maintained by 
, founded at 
, founded at 
last updated on 2019-02-21 20:41 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
