
The paper demonstrates a flaw in the algorithm presented in "A polynomial-time algorithm for 3-SAT" by Lizhi Du, which incorrectly identifies certain satisfiable 3-CNF boolean formulas as unsatisfiable.


coremsg

a-flaw-in-the-claimed-polynomial-time-algorithm-for-3-sat


A Flaw in the Claimed Polynomial-Time Algorithm for 3-SAT


title_rewrite


The 3-FLIP algorithm, a local search algorithm for the Max-Cut problem, can have a superpolynomial smoothed runtime, in contrast to previous results showing efficient smoothed runtimes for other local search algorithms.


superpolynomial-smoothed-complexity-of-the-3-flip-algorithm-for-the-max-cut-problem


Superpolynomial Smoothed Complexity of the 3-FLIP Algorithm for the Max-Cut Problem
