Book chapter · 2004
Introduction to Complexity Theory and NP-Completeness
Elsevier eBooks, 625–638 · Published 1 January 2004 · DOI 10.1016/b978-012557189-0/50019-6
In brief
“Introduction to Complexity Theory and NP-Completeness” is a 2004 book chapter by Appie van de Liefvoort, published in Elsevier eBooks. OpenAlex counts 1 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 1
- Most cited in
- 2019 (1)
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
van de Liefvoort, A. (2004). Introduction to Complexity Theory and NP-Completeness. Elsevier eBooks, 625–638. https://doi.org/10.1016/b978-012557189-0/50019-6
MLA 9
van de Liefvoort, Appie. “Introduction to Complexity Theory and NP-Completeness.” Elsevier eBooks, 2004, pp. 625–638. https://doi.org/10.1016/b978-012557189-0/50019-6.
Chicago
van de Liefvoort, Appie. 2004. “Introduction to Complexity Theory and NP-Completeness.” Elsevier eBooks: 625–638. https://doi.org/10.1016/b978-012557189-0/50019-6.
Harvard
van de Liefvoort, A. (2004) ‘Introduction to Complexity Theory and NP-Completeness’, Elsevier eBooks, pp. 625–638. doi:10.1016/b978-012557189-0/50019-6.
IEEE
A. van de Liefvoort, “Introduction to Complexity Theory and NP-Completeness,” Elsevier eBooks, pp. 625–638, 2004, doi: 10.1016/b978-012557189-0/50019-6.
BibTeX
@incollection{vandeliefvoort2004introduction,
title = {{Introduction to Complexity Theory and NP-Completeness}},
author = {van de Liefvoort, Appie},
booktitle = {Elsevier eBooks},
publisher = {Elsevier BV},
year = {2004},
pages = {625--638},
doi = {10.1016/b978-012557189-0/50019-6},
url = {https://doi.org/10.1016/b978-012557189-0/50019-6}
}
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 complexity theory
- NP-completeness
- NP-hard problems
- polynomial-time reduction
- P versus NP
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?
van de Liefvoort, A. (2004). Introduction to Complexity Theory and NP-Completeness. Elsevier eBooks, 625–638. https://doi.org/10.1016/b978-012557189-0/50019-6
How many times has this paper been cited?
1 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?
Appie van de Liefvoort.
What is the DOI of this paper?
10.1016/b978-012557189-0/50019-6. The permanent link is https://doi.org/10.1016/b978-012557189-0/50019-6.
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.