bild
School of
Computer Science
and Communication
KTH / CSC / Theory Group / Jakob Nordström / Publications / Long Proofs of (Seemingly) Simple Formulas: Supplementary Material

Long Proofs of (Seemingly) Simple Formulas: Supplementary Material

This page contains supplementary material for the paper

  • Mladen Mikša and Jakob Nordström. Long Proofs of (Seemingly) Simple Formulas. In Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT '14), Lecture Notes in Computer Science, volume 8561, pages 121-137, July 2014.

If and when more extensive experiments are done (as part of the work on the full-length journal version of the paper), data from such experiments will also be published here.

Complete Data from the Experiments for the Conference Version

Tables with all results
All plots

CNF Formula Instances

Fixed bandwidth formulas
Subset cardinality formulas on double cover of random 4-regular graph (SC(G))
Subset cardinality formulas on random partitions (SC*(σ))
Tseitin formulas
Random 3-CNF formulas

Published by: Jakob Nordström <jakobn~at-sign~kth~dot~se>
Updated 2014-11-05