John M. Hitchcock, Aduri Pavan. Comparing Reductions to NP-Complete Sets. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener, editors, Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I. Volume 4051 of Lecture Notes in Computer Science, pages 465-476, Springer, 2006. [doi]
@inproceedings{HitchcockP06:0,
title = {Comparing Reductions to NP-Complete Sets},
author = {John M. Hitchcock and Aduri Pavan},
year = {2006},
doi = {10.1007/11786986_41},
url = {http://dx.doi.org/10.1007/11786986_41},
tags = {completeness},
researchr = {https://researchr.org/publication/HitchcockP06%3A0},
cites = {0},
citedby = {0},
pages = {465-476},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I},
editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener},
volume = {4051},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-35904-4},
}