Journal article · 2005
SIGACT news complexity theory column 48
ACM SIGACT News, 36(3), 24–38 · Published 1 September 2005 · DOI 10.1145/1086649.1086662
In brief
“SIGACT news complexity theory column 48” is a 2005 journal article by Lane A. Hemaspaandra, published in ACM SIGACT News. OpenAlex counts 18 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 18
- Most cited in
- 2012 (1)
- Field-weighted impact
- 2.21
- References
- 76
- Authors
- 1
Abstract
Here is a real gift to the field from David Johnson: After a thirteen year intermission, David is restarting his NP-completeness column. His column will now appear about twice yearly in ACM Transactions on Algorithms. Welcome back David, and thanks! And for those for whom a diet of two per year wont do, meals past… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Hemaspaandra, L. A. (2005). SIGACT news complexity theory column 48. ACM SIGACT News, 36(3), 24–38. https://doi.org/10.1145/1086649.1086662
MLA 9
Hemaspaandra, Lane A. “SIGACT news complexity theory column 48.” ACM SIGACT News, vol. 36, no. 3, 2005, pp. 24–38. https://doi.org/10.1145/1086649.1086662.
Chicago
Hemaspaandra, Lane A. 2005. “SIGACT news complexity theory column 48.” ACM SIGACT News 36 (3): 24–38. https://doi.org/10.1145/1086649.1086662.
Harvard
Hemaspaandra, L. A. (2005) ‘SIGACT news complexity theory column 48’, ACM SIGACT News, 36(3), pp. 24–38. doi:10.1145/1086649.1086662.
IEEE
L. A. Hemaspaandra, “SIGACT news complexity theory column 48,” ACM SIGACT News, vol. 36, no. 3, pp. 24–38, 2005, doi: 10.1145/1086649.1086662.
BibTeX
@article{hemaspaandra2005sigact,
title = {{SIGACT news complexity theory column 48}},
author = {Hemaspaandra, Lane A.},
journal = {ACM SIGACT News},
year = {2005},
volume = {36},
number = {3},
pages = {24--38},
doi = {10.1145/1086649.1086662},
url = {https://doi.org/10.1145/1086649.1086662}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 1 | |
| 2013 | 1 | |
| 2014 | 1 | |
| 2016 | 1 | |
| 2025 | 1 |
Its field-weighted citation impact is 2.21: it has been cited 2.21 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- NP-completeness
- David Johnson
- complexity theory
- computational complexity
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Hemaspaandra, L. A. (2005). SIGACT news complexity theory column 48. ACM SIGACT News, 36(3), 24–38. https://doi.org/10.1145/1086649.1086662
How many times has this paper been cited?
18 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Lane A. Hemaspaandra.
What is the DOI of this paper?
10.1145/1086649.1086662. The permanent link is https://doi.org/10.1145/1086649.1086662.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.