Book chapter · 1998

Computational Complexity

Raymond Greenlaw, H. James Hoover

Elsevier eBooks, 221–240 · Published 1 January 1998 · DOI 10.1016/b978-1-55860-547-3.50012-1

View at the publisherCite this paper

In brief

“Computational Complexity” is a 1998 book chapter by Raymond Greenlaw and H. James Hoover, published in Elsevier eBooks. OpenAlex counts 34 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
34
Most cited in
2021 (4)
Field-weighted impact
1.88
Authors
2

Cite this paper

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

APA 7

Greenlaw, R., & Hoover, H. J. (1998). Computational Complexity. Elsevier eBooks, 221–240. https://doi.org/10.1016/b978-1-55860-547-3.50012-1

MLA 9

Greenlaw, Raymond, and H. James Hoover. “Computational Complexity.” Elsevier eBooks, 1998, pp. 221–240. https://doi.org/10.1016/b978-1-55860-547-3.50012-1.

Chicago

Greenlaw, Raymond and H. James Hoover. 1998. “Computational Complexity.” Elsevier eBooks: 221–240. https://doi.org/10.1016/b978-1-55860-547-3.50012-1.

Harvard

Greenlaw, R. and Hoover, H. J. (1998) ‘Computational Complexity’, Elsevier eBooks, pp. 221–240. doi:10.1016/b978-1-55860-547-3.50012-1.

IEEE

R. Greenlaw and H. J. Hoover, “Computational Complexity,” Elsevier eBooks, pp. 221–240, 1998, doi: 10.1016/b978-1-55860-547-3.50012-1.

BibTeX

@incollection{greenlaw1998computational,
  title     = {{Computational Complexity}},
  author    = {Greenlaw, Raymond and Hoover, H. James},
  booktitle = {Elsevier eBooks},
  publisher = {Elsevier BV},
  year      = {1998},
  pages     = {221--240},
  doi       = {10.1016/b978-1-55860-547-3.50012-1},
  url       = {https://doi.org/10.1016/b978-1-55860-547-3.50012-1}
}

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

Citations by year

YearCitationsShare of the best year
201211
201322
201411
201511
201722
201833
201933
202011
202144

Its field-weighted citation impact is 1.88: it has been cited 1.88 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
  • complexity classes
  • time complexity
  • space complexity
  • P versus NP

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?

Greenlaw, R., & Hoover, H. J. (1998). Computational Complexity. Elsevier eBooks, 221–240. https://doi.org/10.1016/b978-1-55860-547-3.50012-1

How many times has this paper been cited?

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

Raymond Greenlaw, H. James Hoover.

What is the DOI of this paper?

10.1016/b978-1-55860-547-3.50012-1. The permanent link is https://doi.org/10.1016/b978-1-55860-547-3.50012-1.

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.