Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
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, due to the existence of non-planarity graphs, no...
Alternative Titles
Full title
Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_4c3744fe7a684872aeadb5bd653dbb0f
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_4c3744fe7a684872aeadb5bd653dbb0f
Other Identifiers
ISSN
2227-7390
E-ISSN
2227-7390
DOI
10.3390/math11010237
