The Complexity of the Satisfiability Problem for Krom Formulas. - Larry Denenberg; Harry R. Lewis (Theor. Comput. Sci., 1984)

Definability by Constant-Depth Polynomial-Size Circuits - Larry Denenberg; Yuri Gurevich; Saharon Shelah (Inf. Control., 1986)