Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies

Martin Lück, Arne Meier, Irina Schindler. Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electronic Colloquium on Computational Complexity (ECCC), 21:134, 2014. [doi]

No reviews for this publication, yet.