Typical-case complexity and the SAT competitions

16 pages•Published: July 28, 2014

Abstract

The aim of this paper is to gather insight into typical-case complexity of the Boolean Satisfiability (SAT) problem by mining the data from the SAT competitions. Specifically, the statistical properties of the SAT benchmarks and their impact on complexity are investigated, as well as connections between different metrics of complexity. While some of the investigated properties and relationships are "folklore" in the SAT community, this study aims at scientifically showing what is true from the folklore and what is not.

Keyphrases: complexity analysis, sat competitions, sat solvers, typical case complexity

In: Daniel Le Berre (editor). POS-14. Fifth Pragmatics of SAT workshop, vol 27, pages 72-87.

Links:	https://easychair.org/publications/paper/c
	https://doi.org/10.29007/cvj9

BibTeX entry

@inproceedings{POS-14:Typical_case_complexity_SAT,
  author    = {Zoltan Mann},
  title     = {Typical-case complexity and the SAT competitions},
  booktitle = {POS-14. Fifth Pragmatics of SAT workshop},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {27},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/c},
  doi       = {10.29007/cvj9},
  pages     = {72-87},
  year      = {2014}}

Download PDF Open PDF in browser