Evaluating Binary Polynomials using Subpolynomials
Howe, J. M. 
ORCID: 0000-0001-8013-6941, Brain, M. ORCID: 0000-0003-4216-7151 & Gàmez-Montolio, A. (2025).
Evaluating Binary Polynomials using Subpolynomials.
In:
CEUR Workshop Proceedings.
SMT 2025: 23rd International Workshop on Satisfiability Modulo Theories, 10-11 Aug 2025, Glasgow, UK.
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.
| Publication Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | © 2025 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). |
| Publisher Keywords: | Polynomials, Satisfiability Modulo Theories, theory of bit-vectors, bit-blasting, modulo arithemetic, finite rings |
| Subjects: | Q Science > QA Mathematics |
| Departments: | School of Science & Technology School of Science & Technology > Department of Computer Science |
| SWORD Depositor: |
Available under License Creative Commons: Attribution International Public License 4.0.
Download (1MB) | Preview
Export
Downloads
Downloads per month over past year
Metadata
MetadataActions (login required)
Admin Login