Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta. Properties of NP-Complete Sets. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 184-197, IEEE Computer Society, 2004. [doi]
@inproceedings{GlasserPSS04,
title = {Properties of NP-Complete Sets},
author = {Christian Glaßer and Aduri Pavan and Alan L. Selman and Samik Sengupta},
year = {2004},
url = {http://csdl.computer.org/comp/proceedings/ccc/2004/2120/00/21200184abs.htm},
tags = {completeness},
researchr = {https://researchr.org/publication/GlasserPSS04},
cites = {0},
citedby = {0},
pages = {184-197},
booktitle = {19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA},
publisher = {IEEE Computer Society},
isbn = {0-7695-2120-7},
}