ECCC-Report TR17-045https://eccc.weizmann.ac.il/report/2017/045Comments and Revisions published for TR17-045en-usSun, 09 Sep 2018 20:33:58 +0300
Revision 2
| Random CNFs are Hard for Cutting Planes |
Robert Robere,
Noah Fleming,
Denis Pankratov,
Toniann Pitassi
https://eccc.weizmann.ac.il/report/2017/045#revision2The random k-SAT model is the most important and well-studied distribution over
k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for
satisfiablity algorithms, and lastly average-case hardness over this distribution has also
been linked to hardness of approximation via Feige’s hypothesis. In this paper, we prove
that any Cutting Planes refutation for random k-SAT requires exponential size, for k that
is logarithmic in the number of variables, and in the interesting regime where the number
of clauses guarantees that the formula is unsatisfiable with high probability.Sun, 09 Sep 2018 20:33:58 +0300https://eccc.weizmann.ac.il/report/2017/045#revision2
Revision 1
| Random CNFs are Hard for Cutting Planes |
Noah Fleming,
Denis Pankratov,
Toniann Pitassi,
Robert Robere
https://eccc.weizmann.ac.il/report/2017/045#revision1The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics and is a benchmark for satisfiability algorithms. In this paper, we prove that any Cutting Planes refutation for random k-SAT requires exponential size, for k that is logarithmic in the number of variables, and in the interesting regime where the number of clauses guarantees that the formula is unsatisfiable with high probability.Mon, 20 Mar 2017 20:22:03 +0200https://eccc.weizmann.ac.il/report/2017/045#revision1
Paper TR17-045
| Random CNFs are Hard for Cutting Planes |
Robert Robere,
Noah Fleming,
Denis Pankratov,
Toniann Pitassi
https://eccc.weizmann.ac.il/report/2017/045The random k-SAT model is the most important and well-studied distribution over
k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for
satisfiablity algorithms, and lastly average-case hardness over this distribution has also
been linked to hardness of approximation via Feige’s hypothesis. In this paper, we prove
that any Cutting Planes refutation for random k-SAT requires exponential size, for k that
is logarithmic in the number of variables, and in the interesting regime where the number
of clauses guarantees that the formula is unsatisfiable with high probability.Tue, 07 Mar 2017 11:38:30 +0200https://eccc.weizmann.ac.il/report/2017/045