{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:08:06Z","timestamp":1764688086634,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Culture and Innovation and the National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary","award":["2022-2.1.1- NL-2022-00004"],"award-info":[{"award-number":["2022-2.1.1- NL-2022-00004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,19]]},"DOI":"10.1145\/3631908.3631929","type":"proceedings-article","created":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T12:05:09Z","timestamp":1706875509000},"page":"145-153","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0231-6557","authenticated-orcid":false,"given":"Gregory","family":"Morse","sequence":"first","affiliation":[{"name":"Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4484-9172","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Kozsik","sequence":"additional","affiliation":[{"name":"Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"N. Chancellor S. Zohren P.\u00a0A. Warburton S.\u00a0C. Benjamin and S. Roberts. 2016. A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph. Scientific Reports 6 1 (18 Nov 2016) 37107. https:\/\/doi.org\/10.1038\/srep37107","DOI":"10.1038\/srep37107"},{"key":"e_1_3_2_1_2_1","first-page":"7","article-title":"Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems. Quantum Info","volume":"11","author":"Choi Vicky","year":"2011","unstructured":"Vicky Choi. 2011. Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems. Quantum Info. Comput. 11, 7\u20138 (jul 2011), 638\u2013648.","journal-title":"Comput."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03006558"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-04634-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580665"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30201-8_33"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3533952"},{"key":"e_1_3_2_1_9_1","volume-title":"Computational Science \u2013 ICCS","author":"N\u00fc\u00dflein Jonas","year":"2023","unstructured":"Jonas N\u00fc\u00dflein, Sebastian Zielinski, Thomas Gabor, Claudia Linnhoff-Popien, and Sebastian Feld. 2023. Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization. In Computational Science \u2013 ICCS 2023, Ji\u0159\u00ed Miky\u0161ka, Cl\u00e9lia de\u00a0Mulatier, Maciej Paszynski, Valeria\u00a0V. Krzhizhanovskaya, Jack\u00a0J. Dongarra, and Peter\u00a0M.A. Sloot (Eds.). Springer Nature Switzerland, Cham, 34\u201347."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_3_2_1_11_1","unstructured":"Z. Yang and Michael\u00a0J. Dinneen. 2016. Graph Minor Embeddings for D-Wave Computer Architecture. https:\/\/api.semanticscholar.org\/CorpusID:55598926"}],"event":{"name":"ICACS 2023: the 7th International Conference on Algorithms, Computing and Systems","acronym":"ICACS 2023","location":"Larissa Greece"},"container-title":["Proceedings of the 7th International Conference on Algorithms, Computing and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631908.3631929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3631908.3631929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T02:16:06Z","timestamp":1755915366000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631908.3631929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":11,"alternative-id":["10.1145\/3631908.3631929","10.1145\/3631908"],"URL":"https:\/\/doi.org\/10.1145\/3631908.3631929","relation":{},"subject":[],"published":{"date-parts":[[2023,10,19]]},"assertion":[{"value":"2024-02-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}