# Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming

9 Feb 2017Hendrik SchaweRoman BleimAlexander K. Hartmann

Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in polynomial time for suitable ranges of the parameter... (read more)

PDF Abstract

No code implementations yet. Submit your code now