SAT solver by CE & BK algorithms
Version 1.3.0.0 (264 KB) by
Sebastien PARIS
Solve SAT problems with 2 stochastic solvers : 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)
Cite As
Sebastien PARIS (2026). SAT solver by CE & BK algorithms (https://uk.mathworks.com/matlabcentral/fileexchange/21259-sat-solver-by-ce-bk-algorithms), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2016b
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
- 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 >
Find more on Functions Supported for Code Acceleration in Help Center and MATLAB Answers
Tags
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
