Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
90
views
0
references
Top references
cited by
162
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,300
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Complexity of Computer Computations
Reducibility among Combinatorial Problems
other
Author(s):
Richard M. Karp
Publication date
(Print):
1972
Publisher:
Springer US
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book Chapter
Publication date (Print):
1972
Pages
: 85-103
DOI:
10.1007/978-1-4684-2001-2_9
SO-VID:
0568ca9c-97cc-4028-aa1d-f78cbba445f8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Evaluation of Rational Functions
pp. 31
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
pp. 105
Permuting Information in Idealized Two-Level Storage
pp. 153
Efficiency of Equivalence Algorithms
pp. 85
Reducibility among Combinatorial Problems
pp. 131
Isomorphism of Planar Graphs (Working Paper)
Similar content
2,300
S100A9, GIF and AAT as potential combinatorial biomarkers in gastric cancer diagnosis and prognosis.
Authors:
Jimmy So
,
Josephine Chung
,
Khay Yeoh
…
SoftMatch: Comparing Scanpaths Using Combinatorial Spatio-Temporal Sequences with Fractal Curves
Authors:
Robert Newport
,
Carlo Russo
,
Sidong Liu
…
Co-LncRNA: investigating the lncRNA combinatorial effects in GO annotations and KEGG pathways based on human RNA-Seq data
Authors:
Zheng Zhao
,
Jing Bai
,
Aiwei Wu
…
See all similar
Cited by
960
OptiType: precision HLA typing from next-generation sequencing data
Authors:
András Szolek
,
Benjamin Schubert
,
Christopher Mohr
…
Identifying personal microbiomes using metagenomic codes.
Authors:
Eric Franzosa
,
Katherine Huang
,
James Meadow
…
Complexity of vehicle routing and scheduling problems
Authors:
J. K. Lenstra
,
A. Rinnooy Kan
See all cited by