Practical complexities of probabilistic algorithms for solving Boolean polynomial systems

Stefano Barbero, Emanuele Bellini 0002, Carlo Sanna, Javier A. Verbel. Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. Discrete Applied Mathematics, 309:13-31, 2022. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: