Hostname: page-component-84b7d79bbc-4hvwz Total loading time: 0 Render date: 2024-07-25T20:19:01.476Z Has data issue: false hasContentIssue false
  • English
  • Français

Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London 1972, pp. 85–103.

Published online by Cambridge University Press:  12 March 2014

Ronald V. Book
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 40 , Issue 4 , December 1975 , pp. 618 - 619
Copyright
Copyright © Association for Symbolic Logic 1975

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)