1. Abío, I., Mayer-Eichberger, V., Stuckey, P.J.: Encoding Linear Constraints into SAT. CoRR abs/2005.02073 (2020). https://arxiv.org/abs/2005.02073
2. Aksoy, L., Flores, P.F., Monteiro, J.: Exact and approximate algorithms for the filter design optimization problem. IEEE Trans. Signal Process. 63(1), 142–154 (2015). https://doi.org/10.1109/TSP.2014.2366713
3. Avizienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. EC-10(3), 389–400 (1961). https://doi.org/10.1109/TEC.1961.5219227
4. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.) Proc. of SAT Competition 2020 – Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51–53. University of Helsinki (2020)
5. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, 2 edn. IOS Press (2021). google-Books-ID: dUAvEAAAQBAJ