News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Book-chapter

Reducibility among Combinatorial Problems

Richard M. Karp · OpenAlex · 1972

Supplementary material available
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Richard M. Karp
Publisher
OpenAlex
Year
1972
Language
English

Resource access

Open the content from the main option or choose another available source.

OpenAlex OpenAlex Works
Entrar por OpenAlex
Main access

Supplementary material available

El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Open material

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Karp, R. M. (1972). Reducibility among Combinatorial Problems. OpenAlex. https://doi.org/10.1007/978-1-4684-2001-2_9

MLA

Karp, Richard M. Reducibility among Combinatorial Problems. OpenAlex, 1972. https://doi.org/10.1007/978-1-4684-2001-2_9.

Chicago

Karp, Richard M. 1972. Reducibility among Combinatorial Problems. OpenAlex. https://doi.org/10.1007/978-1-4684-2001-2_9.

Harvard

Karp, R. M. 1972, Reducibility among Combinatorial Problems, OpenAlex, available at: https://doi.org/10.1007/978-1-4684-2001-2_9 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Reducibility among Combinatorial Problems
Author / contributors
Richard M. Karp
Publisher
OpenAlex
Publication year
1972
Language
English

Subjects

Explore related resources through these subjects.

Countable set; Mathematics; Finite set; Bounded function; Discrete mathematics; Combinatorics; Matching (statistics); Computational complexity theory; Time complexity; Set (abstract data type); Class (philosophy); Simple (philosophy)
Copied