An overview of computational complexity. Cook & Arthur, S. Communications of the ACM, 26(6):400--408, June, 1983. 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
{"_id":"q5jzGgrM6NLqBMbsK","bibbaseid":"cook-arthur-anoverviewofcomputationalcomplexity-1983","downloads":0,"creationDate":"2015-06-13T03:15:11.760Z","title":"An overview of computational complexity","author_short":["Cook","Arthur, S."],"year":1983,"bibtype":"article","biburl":"https://dl.dropboxusercontent.com/u/9343921/library.bib","bibdata":{"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","Arthur, Stephen"],"author_short":["Cook","Arthur, S."],"bibtex":"@article{ Cook1983,\n 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.},\n author = {Cook, Stephen Arthur},\n doi = {10.1145/358141.358144},\n file = {:home/anhduc/Desktop/Dropbox/Mendeley Desktop/An overview of computational complexity - Cook - 1983.pdf:pdf},\n issn = {00010782},\n journal = {Communications of the ACM},\n month = {June},\n number = {6},\n pages = {400--408},\n title = {{An overview of computational complexity}},\n url = {https://www.dropbox.com/sh/v4blv7sito3opzn/AACutjD6ggLg8jYpdagGKiaga/An overview of computational complexity - Cook - 1983.pdf?dl=0},\n volume = {26},\n year = {1983}\n}","bibtype":"article","doi":"10.1145/358141.358144","file":":home/anhduc/Desktop/Dropbox/Mendeley Desktop/An overview of computational complexity - Cook - 1983.pdf:pdf","id":"Cook1983","issn":"00010782","journal":"Communications of the ACM","key":"Cook1983","month":"June","number":"6","pages":"400--408","title":"An overview of computational complexity","type":"article","url":"https://www.dropbox.com/sh/v4blv7sito3opzn/AACutjD6ggLg8jYpdagGKiaga/An overview of computational complexity - Cook - 1983.pdf?dl=0","volume":"26","year":"1983","bibbaseid":"cook-arthur-anoverviewofcomputationalcomplexity-1983","role":"author","urls":{"Paper":"https://www.dropbox.com/sh/v4blv7sito3opzn/AACutjD6ggLg8jYpdagGKiaga/An overview of computational complexity - Cook - 1983.pdf?dl=0"},"downloads":0},"search_terms":["overview","computational","complexity","cook","arthur"],"keywords":[],"authorIDs":[],"dataSources":["DJNCDySdY8tyWWhKE"]}