Login / Signup
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.
Martin Lück
Arne Meier
Irina Schindler
Published in:
Electron. Colloquium Comput. Complex. (2014)
Keyphrases
</>
parameterized complexity
model checking
temporal logic
global constraints
fixed parameter tractable
symmetry breaking
database
objective function
computational problems