Book chapter · 2026
Computational Intractability
ACM eBooks · Published 16 October 2026 · DOI 10.1145/3789281.3789295
In brief
“Computational Intractability” is a 2026 book chapter by Impagliazzo Russell and Ragesh Jaiswal, published in ACM eBooks. OpenAlex counts 0 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 2
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Russell, I., & Jaiswal, R. (2026). Computational Intractability. ACM eBooks. https://doi.org/10.1145/3789281.3789295
MLA 9
Russell, Impagliazzo, and Ragesh Jaiswal. “Computational Intractability.” ACM eBooks, 2026. https://doi.org/10.1145/3789281.3789295.
Chicago
Russell, Impagliazzo and Ragesh Jaiswal. 2026. “Computational Intractability.” ACM eBooks. https://doi.org/10.1145/3789281.3789295.
Harvard
Russell, I. and Jaiswal, R. (2026) ‘Computational Intractability’, ACM eBooks. doi:10.1145/3789281.3789295.
IEEE
I. Russell and R. Jaiswal, “Computational Intractability,” ACM eBooks, 2026, doi: 10.1145/3789281.3789295.
BibTeX
@incollection{russell2026computational,
title = {{Computational Intractability}},
author = {Russell, Impagliazzo and Jaiswal, Ragesh},
booktitle = {ACM eBooks},
publisher = {Association for Computing Machinery},
year = {2026},
doi = {10.1145/3789281.3789295},
url = {https://doi.org/10.1145/3789281.3789295}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- computational intractability
- NP-hardness
- NP-completeness
- complexity classes
- polynomial-time algorithms
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?
Russell, I., & Jaiswal, R. (2026). Computational Intractability. ACM eBooks. https://doi.org/10.1145/3789281.3789295
How many times has this paper been cited?
0 times, according to OpenAlex on 15 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?
Impagliazzo Russell, Ragesh Jaiswal.
What is the DOI of this paper?
10.1145/3789281.3789295. The permanent link is https://doi.org/10.1145/3789281.3789295.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.