{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T12:17:42Z","timestamp":1771849062161,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":7,"publisher":"Springer US","isbn-type":[{"value":"9780387747583","type":"print"},{"value":"9780387747590","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_83","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:04:41Z","timestamp":1219662281000},"page":"457-462","source":"Crossref","is-referenced-by-count":1,"title":["Computational Complexity Theory"],"prefix":"10.1007","author":[{"given":"Hamilton","family":"Emmons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanatan","family":"Rai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"83_CR1_83","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook SA (1971) The complexity of theorem proving procedures. Proc. 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, pp 151\u2013158"},{"key":"83_CR2_83","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York"},{"key":"83_CR3_83","volume-title":"An introduction to the theory of numbers","author":"G.H. Hardy","year":"1979","unstructured":"Hardy GH, Wright EM (1979) An introduction to the theory of numbers. Clarendon Press, Oxford"},{"key":"83_CR4_83","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA"},{"key":"83_CR5_83","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85\u2013103"},{"key":"83_CR6_83","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading, MA"},{"key":"83_CR7_83","volume-title":"Scheduling: Theory, algorithms and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo M (1995) Scheduling: Theory, algorithms and systems. Prentice-Hall, Englewood Cliffs, NJ"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:53:43Z","timestamp":1720695223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_83","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}