Accurate Modeling of Continuous-time SAT Solvers in SPICE
Gespeichert in:
| Titel: | Accurate Modeling of Continuous-time SAT Solvers in SPICE |
|---|---|
| Autoren: | Pershin, Y. V., Nguyen, D. C. |
| Quelle: | Radioengineering. 34:526-540 |
| Publication Status: | Preprint |
| Verlagsinformationen: | Brno University of Technology, 2025. |
| Publikationsjahr: | 2025 |
| Schlagwörter: | SPICE, FOS: Computer and information sciences, 3-SAT, computing technology, Emerging Technologies (cs.ET), boolean satisfiability problem, Computer Science - Emerging Technologies, FOS: Physical sciences, nonlinear dynamical systems, Chaotic Dynamics (nlin.CD), Nonlinear Sciences - Chaotic Dynamics |
| Beschreibung: | Recently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate implementations of two continuous-time dynamical solvers, known in the literature as analog SAT and digital memcomputing, using advanced numerical integration algorithms of SPICE circuit simulators. For this purpose, we have developed Python scripts that convert Boolean satisfiability (SAT) problems into electronic circuits representing the analog SAT and digital memcomputing dynamical systems. Our Python scripts process conjunctive normal form (CNF) files and create netlists that can be directly imported into LTspice. We explore the SPICE implementations of analog SAT and digital memcomputing solvers by applying these to a selected set of problems and present some interesting and potentially useful findings related to digital memcomputing and analog SAT. In this work, we also introduce networks of continuous-time solvers with potential applications extending beyond the solution of Boolean satisfiability problems. |
| Publikationsart: | Article |
| Dateibeschreibung: | text; application/pdf |
| Sprache: | English |
| ISSN: | 1210-2512 |
| DOI: | 10.13164/re.2025.0526 |
| DOI: | 10.48550/arxiv.2412.14690 |
| Zugangs-URL: | http://arxiv.org/abs/2412.14690 https://hdl.handle.net/11012/255413 |
| Rights: | arXiv Non-Exclusive Distribution |
| Dokumentencode: | edsair.doi.dedup.....0623b1166b788dd0a30537eaefc958ec |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | Recently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate implementations of two continuous-time dynamical solvers, known in the literature as analog SAT and digital memcomputing, using advanced numerical integration algorithms of SPICE circuit simulators. For this purpose, we have developed Python scripts that convert Boolean satisfiability (SAT) problems into electronic circuits representing the analog SAT and digital memcomputing dynamical systems. Our Python scripts process conjunctive normal form (CNF) files and create netlists that can be directly imported into LTspice. We explore the SPICE implementations of analog SAT and digital memcomputing solvers by applying these to a selected set of problems and present some interesting and potentially useful findings related to digital memcomputing and analog SAT. In this work, we also introduce networks of continuous-time solvers with potential applications extending beyond the solution of Boolean satisfiability problems. |
|---|---|
| ISSN: | 12102512 |
| DOI: | 10.13164/re.2025.0526 |