SAT solver by CE & BK algorithms
SAT solvers by Cross-Entropy (CE) and a Botev-Kroeze (BK) optimization algorithms
CNF SAT problems can be formulated as :
S(X)=sum(j=1,...,m)C_j, where C_j=max(0 , (2X_i-1)*Aji
Please run the demo files
test_ce_satA.m
test_cemcmc_satA.m
In order to compile mex-files on your platform, please run first
mexme_cebk_sat.m (be sure that mex -setup is done before)
Citation pour cette source
Sebastien PARIS (2025). SAT solver by CE & BK algorithms (https://fr.mathworks.com/matlabcentral/fileexchange/21259-sat-solver-by-ce-bk-algorithms), MATLAB Central File Exchange. Extrait(e) le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
- Code Generation > Fixed-Point Designer > Data Type Exploration > Algorithm Acceleration > Functions Supported for Code Acceleration >
- FPGA, ASIC, and SoC Development > Fixed-Point Designer > Data Type Exploration > Algorithm Acceleration > Functions Supported for Code Acceleration >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
| Version | Publié le | Notes de version | |
|---|---|---|---|
| 1.3.0.0 | Fixed for modern Matlab & 64bits OS versions |
||
| 1.2.0.0 | -Compatible with Linux64 & GCC
|
||
| 1.1.0.0 | - Must compile with non-C99 compiler |
||
| 1.0.0.0 | -Improve CE parse inputs |
