Book chapter · 2025

Beyond NP-Completeness

Mitsunori Ogihara

Springer eBooks, 295–322 · Published 1 January 2025 · DOI 10.1007/978-3-031-84740-0_12

View at the publisherCite this paper

In brief

“Beyond NP-Completeness” is a 2025 book chapter by Mitsunori Ogihara, published in Springer 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
References
5
Authors
1

Cite this paper

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

APA 7

Ogihara, M. (2025). Beyond NP-Completeness. Springer eBooks, 295–322. https://doi.org/10.1007/978-3-031-84740-0_12

MLA 9

Ogihara, Mitsunori. “Beyond NP-Completeness.” Springer eBooks, 2025, pp. 295–322. https://doi.org/10.1007/978-3-031-84740-0_12.

Chicago

Ogihara, Mitsunori. 2025. “Beyond NP-Completeness.” Springer eBooks: 295–322. https://doi.org/10.1007/978-3-031-84740-0_12.

Harvard

Ogihara, M. (2025) ‘Beyond NP-Completeness’, Springer eBooks, pp. 295–322. doi:10.1007/978-3-031-84740-0_12.

IEEE

M. Ogihara, “Beyond NP-Completeness,” Springer eBooks, pp. 295–322, 2025, doi: 10.1007/978-3-031-84740-0_12.

BibTeX

@incollection{ogihara2025beyond,
  title     = {{Beyond NP-Completeness}},
  author    = {Ogihara, Mitsunori},
  booktitle = {Springer eBooks},
  publisher = {Springer Nature},
  year      = {2025},
  pages     = {295--322},
  doi       = {10.1007/978-3-031-84740-0_12},
  url       = {https://doi.org/10.1007/978-3-031-84740-0_12}
}

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

  • PSPACE
  • oracle Turing machines
  • PSPACE-complete problems
  • complexity classes
  • NP-completeness

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?

Ogihara, M. (2025). Beyond NP-Completeness. Springer eBooks, 295–322. https://doi.org/10.1007/978-3-031-84740-0_12

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?

Mitsunori Ogihara.

What is the DOI of this paper?

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

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.