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 MSATK≥3 are nontrivial...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 11; no. 1; p. 237
Main Author:	Zhang, Zhidong
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.01.2023
Subjects:	Algebra Algorithms Artificial intelligence Boolean Boolean satisfiability Complexity computational complexity Computer science Exact solutions Food science Graphs Ising model Lower bounds Machine learning Magnetic fields Mathematics Phase transitions Physics Randomness Spin glasses spin-glass 3D Ising model Three dimensional models Topology Transfer matrices Two dimensional models
ISSN:	2227-7390, 2227-7390
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!