{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:23Z","timestamp":1725796823318},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319092836"},{"type":"electronic","value":"9783319092843"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09284-3_30","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T09:43:21Z","timestamp":1404294201000},"page":"415-421","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Evaluation of Reductions between NP-Complete Problems"],"prefix":"10.1007","author":[{"given":"Carles","family":"Creus","sequence":"first","affiliation":[]},{"given":"Pau","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Khan, S.: Khan Academy (2006), http:\/\/www.khanacademy.org","DOI":"10.1002\/ejoc.200500603"},{"key":"30_CR2","unstructured":"Ng, A., Koller, D.: Coursera (2012), http:\/\/www.coursera.org"},{"key":"30_CR3","unstructured":"Thrun, S., Stavens, D., Sokolsky, M.: Udacity (2012), http:\/\/www.udacity.com"},{"key":"30_CR4","unstructured":"Agarwal, A.: edX (2012), http:\/\/www.edx.org"},{"key":"30_CR5","unstructured":"Garc\u00eda, C., Revilla, M.A.: UVa online judge (1997), http:\/\/uva.onlinejudge.org"},{"key":"30_CR6","unstructured":"Hughes, J.: TopCoder (2000), http:\/\/www.topcoder.com"},{"key":"30_CR7","unstructured":"Mirzayanov, M.: Codeforces (2010), http:\/\/www.codeforces.com"},{"key":"30_CR8","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley (2006)"},{"key":"30_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/3149.3158","volume":"32","author":"S. Skyum","year":"1985","unstructured":"Skyum, S., Valiant, L.G.: A complexity theory based on boolean algebra. Journal of the ACM\u00a032(2), 484\u2013502 (1985)","journal-title":"Journal of the ACM"},{"key":"30_CR11","unstructured":"S\u00f6rensson, N., E\u00e9n, N.: MiniSat 2.1 and MiniSat++ 1.0. Tech. rep., SAT Race 2008 Editions (2008)"},{"issue":"2-4","key":"30_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a04(2-4), 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09284-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T09:27:58Z","timestamp":1649582878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09284-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319092836","9783319092843"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09284-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}