Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines (Q2726419)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines |
scientific article; zbMATH DE number 1621030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines |
scientific article; zbMATH DE number 1621030 |
Statements
18 July 2001
0 references
nonlinear 0-1 problem
0 references
consistent configurations
0 references
configuration neigborhood
0 references
satisfiability
0 references
combinatorial optimization
0 references
higher order Boltzmann machines
0 references
Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines (English)
0 references
The authors develop a mapping of SAT and MAX-SAT into HOBM. They are modeled as 0-1 nonlinear optimization problems. Experiments are performed for studying the accuracy of the proposed methods.
0 references
0.7389007806777954
0 references
