Yong Gao. Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. In Hans Kleine Büning, Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Volume 4996 of Lecture Notes in Computer Science, pages 91-104, Springer, 2008. [doi]
@inproceedings{Gao08:3,
title = {Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms},
author = {Yong Gao},
year = {2008},
doi = {10.1007/978-3-540-79719-7_9},
url = {http://dx.doi.org/10.1007/978-3-540-79719-7_9},
tags = {completeness},
researchr = {https://researchr.org/publication/Gao08%3A3},
cites = {0},
citedby = {0},
pages = {91-104},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings},
editor = {Hans Kleine Büning and Xishun Zhao},
volume = {4996},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-79718-0},
}