{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:33:14Z","timestamp":1776281594979,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":0,"publisher":"Springer US","isbn-type":[{"value":"9781468420036","type":"print"},{"value":"9781468420012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1972]]},"DOI":"10.1007\/978-1-4684-2001-2_9","type":"book-chapter","created":{"date-parts":[[2012,4,8]],"date-time":"2012-04-08T04:48:06Z","timestamp":1333860486000},"page":"85-103","source":"Crossref","is-referenced-by-count":6138,"title":["Reducibility among Combinatorial Problems"],"prefix":"10.1007","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"297","container-title":["Complexity of Computer Computations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4684-2001-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T12:30:04Z","timestamp":1619872204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4684-2001-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972]]},"ISBN":["9781468420036","9781468420012"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","relation":{},"subject":[],"published":{"date-parts":[[1972]]}}}