Efthimios G. Lalas

Learn More
On input a random 3-CNF formula of clauses-to-variables ratio r 3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of clauses, irrespective of their size and the number of occurrences of the negation of the literal (ties are broken randomly; 1-clauses when they appear get priority). We prove that(More)
We analyze an algorithm that in each free step Selects & Sets to a value a pair of complementary literals of specified corresponding degrees. Unit Clauses, if they exist, are given priority. This algorithm is proved to succeed on input random 3-CNF formulas of density c3 = 3.52+, establishing that the conjectured threshold value for random 3-CNF formulas is(More)
  • 1