Parametrised Complexity of Satisfiability in Temporal Logic

ACM Transactions on Computational Logic 2017 / 01 Vol. 18; Iss. 1

Parametrised Complexity of Satisfiability in Temporal Logic

Lück, Martin, Meier, Arne, Schindler, Irena
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
18
Language:
english
Journal:
ACM Transactions on Computational Logic
DOI:
10.1145/3001835
Date:
January, 2017
File:
PDF, 583 KB
english, 2017
Conversion to is in progress
Conversion to is failed