1 |
TOVEY C A. A simplified NP-complete satisfiability problem [J]. Discrete Applied Mathematics, 1984, 8(1): 85-89. 10.1016/0166-218x(84)90081-7
|
2 |
SCHNEIDER S, BURGHOLZER L, WILLE R. A SAT encoding for optimal Clifford circuit synthesis [C]// Proceedings of the 28th Asia and South Pacific Design Automation Conference. New York: ACM, 2023: 190-195. 10.1145/3566097.3567929
|
3 |
KANG M, LI Y, JIAO L, et al. Differential analysis of ARX block ciphers based on an improved genetic algorithm [J]. Chinese Journal of Electronics, 2023, 32(2): 225-236. 10.23919/cje.2021.00.415
|
4 |
LI J, HAN D, WU Z, et al. A novel system for medical equipment supply chain traceability based on alliance chain and attribute and role access control [J]. Future Generation Computer Systems, 2023, 142: 195-211. 10.1016/j.future.2022.12.037
|
5 |
BRESLER G, HUANG B. The algorithmic phase transition of random kSAT for low degree polynomials [C]// Proceedings of the IEEE 62nd Annual Symposium on Foundations of Computer Science. Piscataway: IEEE, 2022: 298-309. 10.1109/focs52979.2021.00038
|
6 |
AL-YAHYA T, MENAI M E B A, MATHKOUR H. Boosting the performance of CDCL-based SAT solvers by exploiting backbones and backdoors [J]. Algorithms, 2022, 15(9): No.302. 10.3390/a15090302
|
7 |
ALYAHYA T N, MENAI M E B, MATHKOUR H. On the structure of the Boolean satisfiability problem: a survey [J]. ACM Computing Surveys, 2022, 55(3): No.46. 10.1145/3491210
|
8 |
NOGUCHI T, FUJIWARA A. An asynchronous P system with a DPLL algorithm for solving SAT [J]. International Journal of Networking and Computing, 2022, 12(2): 238-252. 10.15803/ijnc.12.2_238
|
9 |
LUO M, LI C-M, XIAO F, et al. An effective learnt clause minimization approach for CDCL SAT solvers [C]// Proceedings of the 26th International Joint Conference on Artificial Intelligence. New York: ACM, 2017: 703-711. 10.24963/ijcai.2017/98
|
10 |
HIRECHE C, DRIAS H, MOULAI H. Grid based clustering for satisfiability solving [J]. Applied Soft Computing, 2020, 88: 106069. 10.1016/j.asoc.2020.106069
|
11 |
FU H, XU Y, CHEN S, et al. Improving WalkSAT for random 3-SAT problems [J]. Journal of Universal Computer Science, 2020, 26(2): 220-243. 10.3897/jucs.2020.013
|
12 |
VARMANTCHAONALA C M, FENDJI J L K E, NJAFA J P T, et al. Quantum hybrid algorithm for solving SAT problem [J]. Engineering Applications of Artificial Intelligence, 2023, 121: 106058. 10.1016/j.engappai.2023.106058
|
13 |
BALYO T, CHRPA L. Using algorithm configuration tools to generate hard SAT benchmarks [C]// Proceedings of the 11th International Symposium on Combinatorial Search. Menlo Park, CA: AAAI Press, 2018: 133-137.
|
14 |
BYSKOV J M, MADSEN B A, SKJERNAA B. New algorithms for exact satisfiability [J]. Theoretical Computer Science, 2005, 332(1/2/3): 515-541. 10.1016/j.tcs.2004.12.023
|
15 |
王晓峰,于卓,周锦程,等.随机均衡正则恰当(2s,k)-SAT问题的可满足相变[J].华中科技大学学报(自然科学版), 2022, 50(2): 105-111.
|
|
WANG X F, YU Z, ZHOU J C, et al. Phase transition of in random balance regular exact(2s,k)-SAT problem [J]. Journal of Huazhong University of Science and Technology (Natural Science Edition), 2022,50(2):105-111.
|
16 |
周俊萍,姜蕴晖,殷明浩.最坏情况下X2SAT问题的上界[J].计算机研究与发展,2014,51(3):598-605. 10.7544/issn1000-1239.2014.20120587
|
|
ZHOU J P, JIANG Y H, YIN M H. New worst-case upper bounds for X2SAT [J]. Journal of Computer Research and Development, 2014,51(3):598-605. 10.7544/issn1000-1239.2014.20120587
|
17 |
OSTROWSKI R, PARIS L. From XSAT to SAT by exhibiting equivalencies [C]// Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence. Piscataway: IEEE, 2008: 84-91. 10.1109/ictai.2008.80
|
18 |
FANG C L, LIU J. A linear algebra formulation for boolean satisfiability testing [EB/OL]. [2023-01-23]. .
|
19 |
LIU J, ZHOU H. A development of LAF for satisfying assignments search [C]// Proceedings of the IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference. Piscataway: IEEE, 2019: 719-726. 10.1109/itnec.2019.8729332
|
20 |
BALINT A, SCHÖNING U. Choosing probability distributions for stochastic local search and the role of make versus break [C]// Proceedings of 15th International Conference on Theory and Applications of Satisfiability Testing. Berlin: Springer, 2012: 16-29. 10.1007/978-3-642-31612-8_3
|
21 |
CAI S, SU K. Configuration checking with aspiration in local search for SAT [C]// Proceedings of the 26th AAAI Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press, 2012: 434-440.
|