{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:40Z","timestamp":1750306840754,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,3,17]],"date-time":"2014-03-17T00:00:00Z","timestamp":1395014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2014,3,17]]},"DOI":"10.1145\/2596583.2596589","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T13:45:50Z","timestamp":1395668750000},"page":"20-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Review of boolean functions"],"prefix":"10.1145","volume":"45","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[{"name":"NICTA and University of New South Wales, Australia"}]}],"member":"320","published-online":{"date-parts":[[2014,3,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.5962\/bhl.title.29413","volume-title":"An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities","author":"Boole G.","year":"1854","unstructured":"G. Boole . An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities . 1854 . G. Boole. An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities. 1854."},{"key":"e_1_2_1_2_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2596583.2596589","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2596583.2596589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:04Z","timestamp":1750234204000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2596583.2596589"}},"subtitle":["theory, algorithms, and applications by Yves Crama and Peter L. Hammer"],"short-title":[],"issued":{"date-parts":[[2014,3,17]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3,17]]}},"alternative-id":["10.1145\/2596583.2596589"],"URL":"https:\/\/doi.org\/10.1145\/2596583.2596589","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2014,3,17]]},"assertion":[{"value":"2014-03-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}