From trits to bits in z3 solver: a high-performance triplication of strong starters
Received: 10 Nov 2026 Accepted: 12 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 463–466
Abstract
The triplication method for constructing strong starters in cyclic groups \(\mathbb {Z}_{3m}\) was earlier implemented with SAT/SMT solver z3 using constraints for unknowns with values in \(\{0,1,2\}\). Emulation by Boolean constraints boosted performance by several orders of magnitude.
Keywords: strong starter, triplication, SAT solver z3.
BibTeX
@article{IS-Ogandzhanyants-Sadov2026,
author = {Ogandzhanyants, Oleg Sergeevich and Sadov, Sergey Yurievich},
title = {{From trits to bits in z3 solver: a high-performance triplication of strong starters}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {463--466},
}
AMSBIB
\Bibitem{IS-Ogandzhanyants-Sadov2026}
\by O.\,S.~Ogandzhanyants, S.\,Y.~Sadov
\paper From trits to bits in z3 solver: a high-performance triplication of strong starters
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 463--466
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU