Boolean functions have two standard representations. Conjunctive Normal Form (CNF) is the language of SAT solvers — products of sums. Algebraic Normal Form (ANF) is the language of cryptography — sums of products over GF(2). Converting between them naively produces exponential blowup because a single clause in CNF can correspond to exponentially many monomials in ANF.
The power term polynomial algebra bridges them without the blowup. Instead of representing each clause as a sum of monomials, the algebra encodes the monomial structure implicitly through a polynomial that evaluates to 1 on exactly the satisfying assignments of the clause. The key: the polynomial's degree equals the clause width, not the number of monomials.
The representation preserves the structural information of both forms. From the polynomial, you can read off the CNF clause structure (which variables appear, which are negated) and the ANF monomial structure (which products contribute) without expanding either into the other. The polynomial IS the bridge — it simultaneously encodes both representations compactly.
The algebraic properties are clean: the polynomials form a graded ring, conjunction maps to multiplication, and the degree bounds are tight. Operations that are natural in one normal form (resolution in CNF, XOR in ANF) translate to polynomial operations with controlled degree growth.
Two normal forms, exponentially far apart when converted directly. One algebraic object that contains both. The bridge exists because both forms encode the same Boolean function — the polynomial algebra makes the shared content explicit.