Thomas Seed, Andy King, Neil Evans. Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. In Luca Pulina, Martina Seidl, editors, Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Volume 12178 of Lecture Notes in Computer Science, pages 361-377, Springer, 2020. [doi]
@inproceedings{SeedKE20,
title = {Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases},
author = {Thomas Seed and Andy King and Neil Evans},
year = {2020},
doi = {10.1007/978-3-030-51825-7_26},
url = {https://doi.org/10.1007/978-3-030-51825-7_26},
researchr = {https://researchr.org/publication/SeedKE20},
cites = {0},
citedby = {0},
pages = {361-377},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
editor = {Luca Pulina and Martina Seidl},
volume = {12178},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-51825-7},
}