The Complexity of Polynomial-Time Approximation

Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond. The Complexity of Polynomial-Time Approximation. Theory Comput. Syst., 41(3):459-477, 2007. [doi]

@article{CaiFJR07,
  title = {The Complexity of Polynomial-Time Approximation},
  author = {Liming Cai and Michael R. Fellows and David W. Juedes and Frances A. Rosamond},
  year = {2007},
  doi = {10.1007/s00224-007-1346-y},
  url = {http://dx.doi.org/10.1007/s00224-007-1346-y},
  researchr = {https://researchr.org/publication/CaiFJR07},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {41},
  number = {3},
  pages = {459-477},
}