{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:16:22Z","timestamp":1772694982068,"version":"3.50.1"},"reference-count":53,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,31]]},"DOI":"10.1109\/hpca68181.2026.11408459","type":"proceedings-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:47:22Z","timestamp":1772657242000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters"],"prefix":"10.1109","author":[{"given":"Zhezheng","family":"Ren","sequence":"first","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenao","family":"Yuan","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuke","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Su","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Handbook of Satisfiability, ser. Frontiers in Artificial Intelligence and Applications","volume":"185","author":"Biere","year":"2009"},{"key":"ref2","first-page":"89","article-title":"Satisfiability solvers","volume-title":"Handbook of Knowledge Representation","author":"Gomes","year":"2008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HOST49136.2021.9702267"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/04\/P04004"},{"key":"ref9","first-page":"143","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"2023","journal-title":"Logic, automata, and computational complexity: The works of Stephen A. Cook"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2024.3352585"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC42615.2023.10067380"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2024.3352907"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2013.31"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2019.06.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC49657.2024.10454397"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/VLSITechnologyandCir46783.2024.10631503"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2025.3617458"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms9941"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CICC53496.2022.9772850"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC49661.2025.10904814"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-71654-y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1364\/AOP.475823"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS58744.2024.10558658"},{"key":"ref24","article-title":"Accelerating hybrid xor - cnf sat problems natively with in-memory computing","author":"Im","year":"2025","journal-title":"arXiv preprint"},{"key":"ref25","volume-title":"Satlib - benchmark problems","year":"2000"},{"key":"ref26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90081-7"},{"key":"ref28","volume-title":"MiniSat sat solver","author":"E\u00e9n","year":"2003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"ref30","first-page":"399","article-title":"Predicting learnt clauses quality in modern sat solvers","volume-title":"Proceedings of the 21st international joint conference on Artificial intelligence (IJCAI)","author":"Audemard","year":"2009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65627-9_7"},{"key":"ref32","article-title":"Lingeling and friends at the sat challenge 2012","author":"Biere","year":"2012","journal-title":"Proc. of SAT Competition"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-80223-3_27"},{"key":"ref35","volume-title":"MiniSat: A minimalistic, high-performance SAT solver (GitHub repository)","author":"S\u00f6rensson","year":"2025"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_47"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435.032"},{"key":"ref38","volume-title":"Handbook of satisfiability","volume":"185","author":"Biere","year":"2009"},{"key":"ref39","first-page":"29","article-title":"Hw-bcp: A custom hardware accelerator for sat suitable for single chip implementation for large benchmarks","volume-title":"Proceedings of the 26th Asia and South Pacific Design Automation Conference","author":"Park","year":"2021"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2021.3062821"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-025-01393-3"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ESSERC62670.2024.10719549"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2025.3598289"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref45","first-page":"220","article-title":"Grasp: A search algorithm for propositional satisfiability","volume-title":"Proceedings of ICCAD. IEEE","author":"Marques-Silva","year":"1999"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190070"},{"key":"ref47","article-title":"Gpusharesat: a sat solver using the gpu for clause sharing","author":"Pr\u00e9vot","year":"2020","journal-title":"arXiv preprint"},{"key":"ref48","article-title":"Leveraging gpus for effective clause sharing in parallel sat solving","volume-title":"Proceedings of SAT (Solver Engineering track)","author":"Meel","year":"2021"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359579"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3706628.3708869"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-60316-y"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-49966-6"}],"event":{"name":"2026 IEEE International Symposium on High Performance Computer Architecture (HPCA)","location":"Sydney, Australia","start":{"date-parts":[[2026,1,31]]},"end":{"date-parts":[[2026,2,4]]}},"container-title":["2026 IEEE International Symposium on High Performance Computer Architecture (HPCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11408404\/11408433\/11408459.pdf?arnumber=11408459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T06:40:01Z","timestamp":1772692801000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11408459\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,31]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/hpca68181.2026.11408459","relation":{},"subject":[],"published":{"date-parts":[[2026,1,31]]}}}