Author:
Xie Yan-Feng,Yuan Chun-Ming,Jing Rui-Juan
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Li H, Xia B, and Zhao T, Local search for solving satisfiability of polynomial formulas, Lecture Notes in Computer Science, 2023, 13965): 87–109.
2. Hu X, Xu S, Tu Y, et al., CNF characterization of sets over ℤn2 and its applications in cryptography, Journal of Systems Science & Complexity, 2023, DOI: https://doi.org/10.1007/s11424-024-3168-2.
3. Barrett C, Sebastiani R, Seshia S A, et al., Satisfiability modulo theories, Handb. Satisfiability, 2009, 185): 825–885.
4. Davenport J H, England M, Griggio A, et al., Symbolic computation and satisfiability checking, Journal of Symbolic Computation, 2020, 100): 1–10.
5. Lecture Notes in Computer Science;C Barrett,2011