Convergence properties of optimization algorithms for the SAT problem

DOI10.1109/12.485373MaRDI QIDQ4420897zbMATH OpenOpenAlexFDO

Authors J. Gu, Qian-Ping Gu, Du Ding-Zhu

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.485373

zbMATH Keywords

convergence ratiosatisfiabilitytime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 776082
• scientific article; zbMATH DE number 1113992
• An algorithm for the satisfiability problem of formulas in conjunctive normal form
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

Cited in

(2)

• scientific article; zbMATH DE number 776082 (Why is no real title available?)
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

This page was built for publication: Convergence properties of optimization algorithms for the SAT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420897)