{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:31Z","timestamp":1750307371702,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1973,4,1]],"date-time":"1973-04-01T00:00:00Z","timestamp":102470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-70-A-0362-0006"],"award-info":[{"award-number":["N00014-70-A-0362-0006"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1973,4]]},"abstract":"<jats:p>Cook [1] and Karp [2] have shown that a large class of combinatorial decision problems can be solved in time bounded by a polynomial in the size of the problem iff there is a polynomial time procedure for deciding whether a disjunctive formula with at most three literals per disjunct in the propositional calculus is a tautology.<\/jats:p>","DOI":"10.1145\/1811123.1811124","type":"journal-article","created":{"date-parts":[[2010,6,11]],"date-time":"2010-06-11T18:52:51Z","timestamp":1276282371000},"page":"17-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A note on disjunctive form tautologies"],"prefix":"10.1145","volume":"5","author":[{"given":"M.","family":"Bauer","sequence":"first","affiliation":[{"name":"University of Toronto"}]},{"given":"D.","family":"Brand","sequence":"additional","affiliation":[{"name":"University of Toronto"}]},{"given":"M.","family":"Fischer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"A.","family":"Meyer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"M.","family":"Paterson","sequence":"additional","affiliation":[{"name":"University of Warwick"}]}],"member":"320","published-online":{"date-parts":[[1973,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations, ed. R. E. Miller and J. W. Thatcher","author":"Karp R.","year":"1972"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811123.1811124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1811123.1811124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:54Z","timestamp":1750245774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811123.1811124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,4]]},"references-count":2,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1973,4]]}},"alternative-id":["10.1145\/1811123.1811124"],"URL":"https:\/\/doi.org\/10.1145\/1811123.1811124","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1973,4]]},"assertion":[{"value":"1973-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}