{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:14Z","timestamp":1750309514552,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["T2293700"],"award-info":[{"award-number":["T2293700"]}]},{"name":"Natural Sciences and Engineering Research Council of Canada","award":["ES0048688"],"award-info":[{"award-number":["ES0048688"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3657387","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Approximate Decomposition Solver using Ising Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6232-4460","authenticated-orcid":false,"given":"Weihua","family":"Xiao","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9483-8167","authenticated-orcid":false,"given":"Tingting","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6162-2778","authenticated-orcid":false,"given":"Xingyue","family":"Qian","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8849-4994","authenticated-orcid":false,"given":"Jie","family":"Han","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5129-9431","authenticated-orcid":false,"given":"Weikang","family":"Qian","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"280","article-title":"Energy-efficient computing using adaptive table lookup based on nonvolatile memories","author":"Cong J.","year":"2013","unstructured":"J. Cong et al., \"Energy-efficient computing using adaptive table lookup based on nonvolatile memories,\" in ISLPED. IEEE, 2013, pp. 280--285.","journal-title":"ISLPED. IEEE"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2015.2505723"},{"key":"e_1_3_2_1_3_1","first-page":"175","article-title":"Symmetric bipartite tables for accurate function approximation","author":"Schulte M. J.","year":"1997","unstructured":"M. J. Schulte and J. E. Stine, \"Symmetric bipartite tables for accurate function approximation,\" in ARITH. IEEE, 1997, pp. 175--183.","journal-title":"ARITH. IEEE"},{"issue":"1","key":"e_1_3_2_1_4_1","first-page":"89","article-title":"Hierarchical multipartite function evaluation","volume":"66","author":"Hsiao S.-F.","year":"2016","unstructured":"S.-F. Hsiao et al., \"Hierarchical multipartite function evaluation,\" IEEE TC, vol. 66, no. 1, pp. 89--99, 2016.","journal-title":"IEEE TC"},{"key":"e_1_3_2_1_5_1","first-page":"1327","article-title":"Resistive configurable associative memory for approximate computing","author":"Imani M.","year":"2016","unstructured":"M. Imani et al., \"Resistive configurable associative memory for approximate computing,\" in DATE. IEEE, 2016, pp. 1327--1332.","journal-title":"DATE. IEEE"},{"key":"e_1_3_2_1_6_1","first-page":"1497","article-title":"Approximate associative memristive memory for energy-efficient GPUs","author":"Rahimi A.","year":"2015","unstructured":"A. Rahimi et al., \"Approximate associative memristive memory for energy-efficient GPUs,\" in DATE. IEEE, 2015, pp. 1497--1502.","journal-title":"DATE. IEEE"},{"issue":"3","key":"e_1_3_2_1_7_1","first-page":"239","article-title":"An algorithm for the disjunctive decomposition of switching functions","volume":"100","author":"Shen V.-S.","year":"1970","unstructured":"V.-S. Shen and A. C. Mckellar, \"An algorithm for the disjunctive decomposition of switching functions,\" IEEE TC, vol. 100, no. 3, pp. 239--248, 1970.","journal-title":"IEEE TC"},{"key":"e_1_3_2_1_8_1","first-page":"517","article-title":"Approximate disjoint bi-decomposition and its application to approximate logic synthesis","author":"Yao Y.","year":"2017","unstructured":"Y. Yao et al., \"Approximate disjoint bi-decomposition and its application to approximate logic synthesis,\" in ICCD. IEEE, 2017, pp. 517--524.","journal-title":"ICCD. IEEE"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"DALTA: A decomposition-based approximate lookup table architecture","author":"Meng C.","year":"2021","unstructured":"C. Meng et al., \"DALTA: A decomposition-based approximate lookup table architecture,\" in ICCAD. IEEE, 2021, pp. 1--8.","journal-title":"ICCAD. IEEE"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"High-accuracy low-power reconfigurable architectures for decomposition-based approximate lookup table","author":"Qian X.","year":"2023","unstructured":"X. Qian et al., \"High-accuracy low-power reconfigurable architectures for decomposition-based approximate lookup table,\" in DATE, 2023, pp. 1--6.","journal-title":"DATE"},{"key":"e_1_3_2_1_11_1","volume-title":"Combinatorial optimization","author":"Korte B. H.","year":"2011","unstructured":"B. H. Korte et al., Combinatorial optimization. Springer, 2011, vol. 1."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1987.12000742"},{"key":"e_1_3_2_1_13_1","first-page":"1877","article-title":"A review of simulation algorithms of classical Ising machines for combinatorial optimization","author":"Zhang T.","year":"2022","unstructured":"T. Zhang et al., \"A review of simulation algorithms of classical Ising machines for combinatorial optimization,\" in ISCAS. IEEE, 2022, pp. 1877--1881.","journal-title":"ISCAS. IEEE"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01009452"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aav2372"},{"key":"e_1_3_2_1_16_1","volume-title":"Real-time trading system based on selections of potentially profitable, uncorrelated, and balanced stocks by NP-hard combinatorial optimization,\" arXiv preprint arXiv:2307.06339","author":"Tatsumura K.","year":"2023","unstructured":"K. Tatsumura et al., \"Real-time trading system based on selections of potentially profitable, uncorrelated, and balanced stocks by NP-hard combinatorial optimization,\" arXiv preprint arXiv:2307.06339, 2023."},{"key":"e_1_3_2_1_17_1","first-page":"548","article-title":"Efficient traveling salesman problem solvers using the Ising model with simulated bifurcation","author":"Zhang T.","year":"2022","unstructured":"T. Zhang and J. Han, \"Efficient traveling salesman problem solvers using the Ising model with simulated bifurcation,\" in DATE. IEEE, 2022, pp. 548--551.","journal-title":"DATE. IEEE"},{"key":"e_1_3_2_1_18_1","volume-title":"Phys.","author":"Lucas A.","year":"2014","unstructured":"A. Lucas, \"Ising formulations of many NP problems,\" Front. Phys., 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.35848\/1882-0786\/acaba9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abe7953"},{"key":"e_1_3_2_1_21_1","volume-title":"Jacob et al., \"Eigen v3,\" http:\/\/eigen.tuxfamily.org","author":"Guennebaud G.","year":"2010","unstructured":"G. Guennebaud, B. Jacob et al., \"Eigen v3,\" http:\/\/eigen.tuxfamily.org, 2010."},{"key":"e_1_3_2_1_22_1","unstructured":"Gurobi Optimization LLC \"Gurobi Optimizer Reference Manual \" 2023. [Online]. Available: https:\/\/www.gurobi.com"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2016.2630270"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Francisco CA USA","acronym":"DAC '24"},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3657387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:01Z","timestamp":1750295881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":23,"alternative-id":["10.1145\/3649329.3657387","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3657387","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}