Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean satisfiability (K-SAT) problems for K ≥ 3 <inline-formula><math x...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI AG
2023-01-01
|
| Reeks: | Mathematics |
| Onderwerpen: | |
| Online toegang: | https://www.mdpi.com/2227-7390/11/1/237 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|