[15p-M_123-1~8] FS.1 Focused Session "AI Electronics"

3:15 PM - 3:30 PM JST(6:15 AM - 6:30 AM UTC)Presentation by Applicant for JSAP Young Scientists Presentation Award

[15p-M_123-5] Characterization of Solution Search Time in Analog Electronic Amoeba Solving Satisfiability Problem

〇Tokushi Maruoka¹, Seiya Kasai¹, Zenji Yatabe¹ (1.RCIQE, Hokkaido Univ.)

Keywords:

electronic amoeba

An electronic computing system inspired by slime mold, “analog electronic amoeba,” can solve the optimization problem, similar to the emerging optimization computers such as quantum annealers. A central interest in this system is the difference in computing performance among currently available optimization computers. In this study, we investigate the computing time for solving a satisfiability problem (SAT), which is a highly versatile optimization problem related to various applications, by the analog electronic amoeba. We confirm that the quantitative evaluation of the relationship between the problem scale of the SAT and the computing time becomes possible by applying our unique reconfigurable problem mapping circuit.