Properties of NP-Complete Sets

Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta. Properties of NP-Complete Sets. Electronic Colloquium on Computational Complexity (ECCC), (019), 2004. [doi]

@article{ECCC-TR04-019,
  title = {Properties of NP-Complete Sets},
  author = {Christian Glaßer and Aduri Pavan and Alan L. Selman and Samik Sengupta},
  year = {2004},
  url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-019/index.html},
  tags = {completeness},
  researchr = {https://researchr.org/publication/ECCC-TR04-019},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {019},
}