Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
For infinitely many n > 0 we construct contradictory formulas αn in conjunctive form with n literals such that every regular proof tree which proves the contradiction must contain 2cn distinct clauses for some c > 0. This implies a 2cn lower bound for the number of distinct clauses which are generated by the Davis-Putnam procedure applied to αn using any order of variable elimination. © 1977.
Hendrik F. Hamann
InterPACK 2013
Robert C. Durbeck
IEEE TACON
Nanda Kambhatla
ACL 2004
John M. Boyer, Charles F. Wiecha
DocEng 2009