1 problem

0 votes0 replies0 views
Copeland–Gamarnik–Mendelson–Sorin satisfiable-clause limit conjecture
Consider a uniformly random instance of a $K$ -SAT problem on $N$ variables with $cN$ clauses, and let the number of satisfiable clauses be maximized over all assignments. Copeland–…
Conjectureopeninterpolation-method random-graphs random-satisfiabilityarXiv posted 2 days ago

Copeland–Gamarnik–Mendelson–Sorin satisfiable-clause limit conjecture