Computational Complexity, NP Completeness and Optimization Duality: A Survey

Prabhu Manyem, Julien Ugon. Computational Complexity, NP Completeness and Optimization Duality: A Survey. Electronic Colloquium on Computational Complexity (ECCC), 19:9, 2012. [doi]

@article{ManyemU12,
  title = {Computational Complexity, NP Completeness and Optimization Duality: A Survey},
  author = {Prabhu Manyem and Julien Ugon},
  year = {2012},
  url = {http://eccc.hpi-web.de/report/2012/009},
  researchr = {https://researchr.org/publication/ManyemU12},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {19},
  pages = {9},
}