The complexity of the satisfiability problem for Krom formulas

Larry Denenberg, Harry R Lewis
1984 Theoretical Computer Science  
Aiken Compuration Laboratory 102, Harvard lJnicer.tiw. 'Cambridge. MA t,tl.Vt. ;/..$.A Communicated by M. Rabin Received 5 March I983 Revised I5 October I983 Ab&W. We study the computational complexity of the satisfiability problem for Krom rf'Nf L, formulas. Upper and lower boundr are obtained for several decidable clasws of formulas cie*eermined by quantifier prefix and degree of predicate letters. For example, we show that determinmg satisfiability of Krom formulas with quantifier prefix of
more » ... he form 3. .3V. . El.. .3 ir compl nc for deterministic exponential time, but that if the number of universal quantifier5 is bounded tkn polynomial time suffices.
doi:10.1016/0304-3975(84)90138-5 fatcat:pvr35qs3tjgubnqw4elb6sejoa