This paper establishes a randomized algorithm that finds a satisfying assignment for a satisfiable formula F in 3-CNF in O(1.32793n) expected running time. The algorithms is based on the analysis of socalled strings, which are sequences of 3-clauses where non-succeeding clauses do not share a variable and succeeding clauses share one or two variables. One the one hand, if there are not many ind...

Please refer tot his post as: Richard Wolfram, ‘‘Most Favored Nations’ (MFN) Clauses under the Spotlight: U.S. v. Blue Cross Blue Shield of Michigan — When Might Otherwise Competitively Neutral or Procompetitive MFN Clauses Violate the A n t i t r u s t L a w s ? ’ , A n t i t r u s t C o n n e c t B l o g , J a n u a r y 6 2 0 1 1 , http://antitrustconnect.com/2011/01/06/most-favored-nations-m...