Book chapter · 2022

P, NP, NP-Complete, and NP-Hard Problems

Habib Izadkhah

Springer eBooks, 497–511 · Published 1 November 2022 · DOI 10.1007/978-3-031-17043-0_15

View at the publisherCite this paper

In brief

“P, NP, NP-Complete, and NP-Hard Problems” is a 2022 book chapter by Habib Izadkhah, published in Springer eBooks. OpenAlex counts 8 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
8
Most cited in
2026 (4)
Field-weighted impact
3.70
Authors
1

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Izadkhah, H. (2022). P, NP, NP-Complete, and NP-Hard Problems. Springer eBooks, 497–511. https://doi.org/10.1007/978-3-031-17043-0_15

MLA 9

Izadkhah, Habib. “P, NP, NP-Complete, and NP-Hard Problems.” Springer eBooks, 2022, pp. 497–511. https://doi.org/10.1007/978-3-031-17043-0_15.

Chicago

Izadkhah, Habib. 2022. “P, NP, NP-Complete, and NP-Hard Problems.” Springer eBooks: 497–511. https://doi.org/10.1007/978-3-031-17043-0_15.

Harvard

Izadkhah, H. (2022) ‘P, NP, NP-Complete, and NP-Hard Problems’, Springer eBooks, pp. 497–511. doi:10.1007/978-3-031-17043-0_15.

IEEE

H. Izadkhah, “P, NP, NP-Complete, and NP-Hard Problems,” Springer eBooks, pp. 497–511, 2022, doi: 10.1007/978-3-031-17043-0_15.

BibTeX

@incollection{izadkhah2022complete,
  title     = {{P, NP, NP-Complete, and NP-Hard Problems}},
  author    = {Izadkhah, Habib},
  booktitle = {Springer eBooks},
  publisher = {Springer Nature},
  year      = {2022},
  pages     = {497--511},
  doi       = {10.1007/978-3-031-17043-0_15},
  url       = {https://doi.org/10.1007/978-3-031-17043-0_15}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202322
202411
202511
202644

Its field-weighted citation impact is 3.70: it has been cited 3.70 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

  • computational complexity
  • P
  • NP
  • NP-complete problems
  • NP-hard problems
  • polynomial time
  • complexity classes

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Izadkhah, H. (2022). P, NP, NP-Complete, and NP-Hard Problems. Springer eBooks, 497–511. https://doi.org/10.1007/978-3-031-17043-0_15

How many times has this paper been cited?

8 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?

Habib Izadkhah.

What is the DOI of this paper?

10.1007/978-3-031-17043-0_15. The permanent link is https://doi.org/10.1007/978-3-031-17043-0_15.

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.