{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:33:18Z","timestamp":1763724798189,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,20]]},"DOI":"10.1145\/3658617.3697720","type":"proceedings-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T14:23:57Z","timestamp":1741098237000},"page":"58-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["High-Effort Logic Synthesis Using Randomized Transduction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7960-9913","authenticated-orcid":false,"given":"Yukio","family":"Miyasaka","sequence":"first","affiliation":[{"name":"EECS, UC Berkeley, Berkeley, CA, USA"},{"name":"X, the moonshot factory, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1303-6261","authenticated-orcid":false,"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[{"name":"EECS, UC Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1466-4553","authenticated-orcid":false,"given":"John","family":"Wawrzynek","sequence":"additional","affiliation":[{"name":"EECS, UC Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8081-2751","authenticated-orcid":false,"given":"Dino","family":"Rui\u0107","sequence":"additional","affiliation":[{"name":"X, the moonshot factory, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7368-9723","authenticated-orcid":false,"given":"Xiaoqing","family":"Xu","sequence":"additional","affiliation":[{"name":"X, the moonshot factory, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218691"},{"key":"e_1_3_2_1_2_1","volume-title":"ABC: A System for Sequential Synthesis and Verification","author":"Berkeley Logic Synthesis and Verification Group","year":"2005","unstructured":"Berkeley Logic Synthesis and Verification Group. 2005. ABC: A System for Sequential Synthesis and Verification. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"e_1_3_2_1_4_1","volume-title":"Brayton and Curtis McMullen","author":"Robert","year":"1982","unstructured":"Robert K. Brayton and Curtis McMullen. 1982. The decomposition and factorization of Boolean expressions. In Proc. ISCAS. 29--54."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552082"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1996.569641"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882484"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/123186.105253"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDAC.1993.386447"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811447"},{"key":"e_1_3_2_1_11_1","volume-title":"IWLS2022 contest - EPFL Team. https:\/\/youtu.be\/qUnB-01oMiQ","author":"Costamagna Andrea","year":"2022","unstructured":"Andrea Costamagna, Siang-Yun Lee, Alessandro Tempia Calvino, Hanyu Wang, and Mingfei Yu. 2022. IWLS2022 contest - EPFL Team. https:\/\/youtu.be\/qUnB-01oMiQ"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. SASIMI.","author":"Coudert Olivier","year":"1993","unstructured":"Olivier Coudert, Jean Madre, and Henri Fraisse. 1993. Implicit prime cover computation: an overview. In Proc. SASIMI."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/10721064_26"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/EURDAC.1996.558227"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2897703"},{"key":"e_1_3_2_1_16_1","unstructured":"Adam Hillier and Ngan Vu. 2023. Learning to Design Efficient Logic Circuits. https:\/\/drive.google.com\/file\/d\/1hjZA3PalPRtjE_8z85MhJhl9GVhhheJt\/view?usp=sharing"},{"key":"e_1_3_2_1_17_1","volume-title":"Problems and Results of IWLS 2022 Programming Contest. https:\/\/github.com\/alanminko\/iwls2022-ls-contest","author":"IWLS.","year":"2022","unstructured":"IWLS. 2022. Problems and Results of IWLS 2022 Programming Contest. https:\/\/github.com\/alanminko\/iwls2022-ls-contest"},{"key":"e_1_3_2_1_18_1","volume-title":"Problems and Results of IWLS 2023 Programming Contest. https:\/\/github.com\/alanminko\/iwls2023-ls-contest","author":"IWLS.","year":"2023","unstructured":"IWLS. 2023. Problems and Results of IWLS 2023 Programming Contest. https:\/\/github.com\/alanminko\/iwls2023-ls-contest"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. IWLS. 66--71","author":"Jacob James","year":"2001","unstructured":"James Jacob and Alan Mishchenko. 2001. Unate decomposition of Boolean functions. In Proc. IWLS. 66--71."},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. IWLS. 149--155","author":"Lee Siang-Yun","year":"2023","unstructured":"Siang-Yun Lee, Heinz Riener, and Giovanni De Micheli. 2023. Customizable on-the-fly design space exploration for logic optimization of emerging technologies. In Proc. IWLS. 149--155."},{"volume-title":"Proc. SASIMI. 64--73","year":"1992","key":"e_1_3_2_1_21_1","unstructured":"Shin-ichi Minato. 1992. Fast generation of prime-irredundant covers from binary decision diagrams. In Proc. SASIMI. 64--73."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.264"},{"key":"e_1_3_2_1_23_1","volume-title":"Brayton","author":"Mishchenko Alan","year":"2006","unstructured":"Alan Mishchenko and Robert K. Brayton. 2006. Scalable logic synthesis using a simple circuit structure. In Proc. IWLS. 15--22."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508128.1508152"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473816"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM60383.2024.00023"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.35836"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. NeurIPS.","author":"Oliveira Arlindo","year":"1993","unstructured":"Arlindo Oliveira and Alberto Sangiovanni-Vincentelli. 1993. Learning complex Boolean functions: algorithms and applications. In Proc. NeurIPS."},{"key":"e_1_3_2_1_30_1","unstructured":"Ptolemy.Berkeley.Edu. 1993. ESPRESSO benchmark. https:\/\/ptolemy.berkeley.edu\/projects\/embedded\/pubs\/downloads\/espresso\/index.htm"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.137523"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. IWLS. 98--105","author":"Reichl Franz","year":"2023","unstructured":"Franz Reichl, Friedrich Slivovsky, and Stefan Szeider. 2023. Circuit minimization with exact synthesis: from QBF back to SAT. In Proc. IWLS. 98--105."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. IWLS. 34--40","author":"Testa Elenora","year":"2022","unstructured":"Elenora Testa, Luca Amaru, and Patric Vuillod. 2022. Extending rewiring: reshuffling don't cares to unlock more optimization. In Proc. IWLS. 34--40."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL50879.2020.00055"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.856972"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429513"}],"event":{"name":"ASPDAC '25: 30th Asia and South Pacific Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEICE","IPSJ","IEEE CAS","IEEE CEDA"],"location":"Tokyo Japan","acronym":"ASPDAC '25"},"container-title":["Proceedings of the 30th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658617.3697720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:49Z","timestamp":1750295869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":36,"alternative-id":["10.1145\/3658617.3697720","10.1145\/3658617"],"URL":"https:\/\/doi.org\/10.1145\/3658617.3697720","relation":{},"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"2025-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}