Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
87
views
0
references
Top references
cited by
159
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,434
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,434
Developmentally regulated, combinatorial RNA processing modulates AMPA receptor biogenesis.
Authors:
Ingo Greger
,
Edward B. Ziff
,
Latika Khatri
…
Properties of the combinatorial Hantzsche-Wendt groups
Authors:
J Popko
,
A Szczepanski
Identificación de errores de difícil detección en estimación de estado en sistemas eléctricos usando algoritmos de optimización combinatorial
Translated title: Multiple interacting bad data errors identification in state estimation using combinatorial optimization algorithms
Authors:
Hugo Ruiz F
,
Eliana Mirledy Toro
,
Ramón Gallego
See all similar
Cited by
957
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