Tight Lower Bounds for the Complexity of Multicoloring

ACM Transactions on Computation Theory 2019 / 04 Vol. 11; Iss. 3

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin
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:
11
Language:
english
Journal:
ACM Transactions on Computation Theory
DOI:
10.1145/3313906
Date:
April, 2019
File:
PDF, 454 KB
english, 2019
Conversion to is in progress
Conversion to is failed