Parameterized and subexponential-time complexity of...

Theoretical Computer Science 2015 / 11 Vol. 607

Parameterized and subexponential-time complexity of satisfiability problems and applications

Kanj, Iyad, Szeider, Stefan
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:
607
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2015.08.029
Date:
November, 2015
File:
PDF, 526 KB
english, 2015
Conversion to is in progress
Conversion to is failed