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]

Authors

Martin Lück

This author has not been identified. Look up 'Martin Lück' in Google

Arne Meier

This author has not been identified. Look up 'Arne Meier' in Google

Irina Schindler

This author has not been identified. Look up 'Irina Schindler' in Google