Year: 2025
Type: conference-paper
Abstract: Polynomials over bit-vectors, binary polynomials, are considered algebraically and it is observed that binary polynomials can be considered as a tree of subpolynomials. A construction of such subpolynomials is given. The application of these subpolynomials, along with other recent results on binary polynomials, in encoding polynomials over bit-vectors as part of solving SMT problems is investigated. Preliminary results are given.
Authors: Howe, J. M., Brain, M., Gàmez-Montolio, A.
Institution: City St George's, University of London
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7082325531
FWCI:
Cites:
Cited by:
Related to: