An overview of computational complexity. Cook & Arthur, S. Communications of the ACM, 26(6):400--408, June, 1983.
An overview of computational complexity [link]Paper  doi  abstract   bibtex   
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computahutahonal complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.
@article{ Cook1983,
  abstract = {An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computahutahonal complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.},
  author = {Cook, Stephen Arthur},
  doi = {10.1145/358141.358144},
  file = {:home/anhduc/Desktop/Dropbox/Mendeley Desktop/An overview of computational complexity - Cook - 1983.pdf:pdf},
  issn = {00010782},
  journal = {Communications of the ACM},
  month = {June},
  number = {6},
  pages = {400--408},
  title = {{An overview of computational complexity}},
  url = {https://www.dropbox.com/sh/v4blv7sito3opzn/AACutjD6ggLg8jYpdagGKiaga/An overview of computational complexity - Cook - 1983.pdf?dl=0},
  volume = {26},
  year = {1983}
}

Downloads: 0