DOI: 10.29007/cvj9
|View full text |Cite
|
Sign up to set email alerts
|

Typical-case complexity and the SAT competitions

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 wha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
2
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 22 publications
1
2
0
Order By: Relevance
“…The main metric that we used for comparing the performance of solvers is the number of problem instances they can solve within a given time limit. This is in line with the methodology used at the SAT competitions [39].…”
Section: Evaluation Methodologysupporting
confidence: 82%
See 1 more Smart Citation
“…The main metric that we used for comparing the performance of solvers is the number of problem instances they can solve within a given time limit. This is in line with the methodology used at the SAT competitions [39].…”
Section: Evaluation Methodologysupporting
confidence: 82%
“…Deciding satisfiability is NP-complete. Although modern SAT solvers can sometimes solve extremely large formulas in reasonable time, they may need orders of magnitude more time to solve other, much smaller formulas [39]. Therefore, further research is still needed.…”
Section: Introductionmentioning
confidence: 99%
“…The rightmost three 's below the diagonal are instances where the SAT solver struggled with the formulas generated by Reuse. We noticed more timeouts using Reuse in these instances, which provides more evidence of the well-known fact that there is no strict connection between the size and the hardness of formulas for satisfiability checking [13].…”
Section: Category 4 (♦)mentioning
confidence: 59%