Author:
Bright Curtis,Cheung Kevin K. H.,Stevens Brett,Kotsireas Ilias,Ganesh Vijay
Publisher
Springer International Publishing
Reference40 articles.
1. Ábrahám, E.: Building bridges between symbolic computation and satisfiability checking. In: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp. 1–6. ACM (2015).
https://doi.org/10.1145/2755996.2756636
2. Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT competition. In: Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions (2018).
http://fmv.jku.at/lingeling
3. Bright, C., Cheung, K., Stevens, B., Roy, D., Kotsireas, I., Ganesh, V.: A nonexistence certificate for projective planes of order ten with weight 15 codewords. Applicable Algebra in Engineering, Communication and Computing (2020).
https://doi.org/10.1007/s00200-020-00426-y
4. Bright, C., Kotsireas, I., Ganesh, V.: SAT solvers and computer algebra systems: a powerful combination for mathematics. In: Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, pp. 323–328. IBM Corporation (2019).
https://dl.acm.org/doi/10.5555/3370272.3370309
5. Bright, C., Kotsireas, I., Ganesh, V.: Applying computer algebra systems with SAT solvers to the Williamson conjecture. J. Symb. Comput. 100, 187–209 (2020).
https://doi.org/10.1016/j.jsc.2019.07.024