The Impact of Entropy and Solution Density on Selected SAT Heuristics
We present a new characterization of propositional formulas called entropy, which approximates the freedom we have in assigning the variables. Like several other such measures (e.g., back-door and back-door-key variables), it is computationally expensive to compute. Nevertheless, for small and mediu...
Main Authors: | Dor Cohen, Ofer Strichman |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-09-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/9/713 |
Similar Items
-
Characterizing the Temperature of SAT Formulas
by: Pedro Almagro-Blanco, et al.
Published: (2022-08-01) -
A hierarchy of tractable subclasses for SAT and counting SAT problems
by: Rinard, Martin C., et al.
Published: (2010) -
Heuristics for Quantum Computing Dealing with 3-SAT
by: Jose J. Paulet, et al.
Published: (2023-04-01) -
Bob Miller's SAT math for the clueless : SAT math /
by: Miller, Robert, 1943-
Published: (1999) -
Kuala Sat (Pahang) [peta]
Published: (1965)