Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements
M. Vyalyi · Problems of Information Transmission · 2023
We construct a probabilistic polynomial algorithm for testing the satisfiability of algebraic formulas of depth 3 over the two-element field, with addition as the top operation in the formulas. An algorithm with the same characteristics exists for the problem of testing whether a polynomial given by formulas of this type is identically zero (PIT problem). However, these problems and algorithms for their solution are essentially different. The probabilistic algorithm for the PIT problem is based on the Schwartz–Zippel lemma, whereas the satisfiability testing algorithm proposed in this paper is based on the Valiant–Vazirani lemma.