Add to ORKGThe 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
In the area of query complexity of Boolean functions, the most widely studied cost measure of an alg...
Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core ...
Abstract. It is well known that the ratio of the number of clauses to the number of variables in a r...
I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will ment...
AbstractThe papers in this special issue originated at SAT 2001, the Fourth International Symposium ...
This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak...
This paper is intended as an informal and accessible survey of proof complexity for non-experts, foc...
This report documents the program and the outcomes of Dagstuhl Seminar 22411 "Theory and Practice of...
Determining whether a given propositional logic formulais satisfiable is one of the most fundamental...
This thesis studies two NP-complete problems, {\it Clique} and {\it Boolean Satisfiability} (SAT), u...
Abstract. Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a hal...
The SAT Competitions constitute a well-established series of yearly open international algorithm imp...
The last few years have seen an increasing interest in Boolean Satisfiability (SAT), spurred in part...
AbstractThis is a written record of a survey talk on the topic of typical case complexity of Satisfi...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
In the area of query complexity of Boolean functions, the most widely studied cost measure of an alg...
Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core ...
Abstract. It is well known that the ratio of the number of clauses to the number of variables in a r...
I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will ment...
AbstractThe papers in this special issue originated at SAT 2001, the Fourth International Symposium ...
This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak...
This paper is intended as an informal and accessible survey of proof complexity for non-experts, foc...
This report documents the program and the outcomes of Dagstuhl Seminar 22411 "Theory and Practice of...
Determining whether a given propositional logic formulais satisfiable is one of the most fundamental...
This thesis studies two NP-complete problems, {\it Clique} and {\it Boolean Satisfiability} (SAT), u...
Abstract. Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a hal...
The SAT Competitions constitute a well-established series of yearly open international algorithm imp...
The last few years have seen an increasing interest in Boolean Satisfiability (SAT), spurred in part...
AbstractThis is a written record of a survey talk on the topic of typical case complexity of Satisfi...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
In the area of query complexity of Boolean functions, the most widely studied cost measure of an alg...
Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core ...
Abstract. It is well known that the ratio of the number of clauses to the number of variables in a r...