Boolean Satisfiability
Boolean Satisfiability is a decision problem in computational logic that determines whether there exists a truth assignment to a finite set of Boolean variables that satisfies a given propositional logic formula expressed in conjunctive normal form.
1.8K
Publications
109.5K
Citations
2.9K
Authors
919
Institutions
Publications per year
2017–2026
314
1.8K
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text
1–5 of 1.8K
2.9K
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal
50 publications · 3.5K citations
27
h-index
25
h-index
24
h-index
23
h-index
19
h-index
1–5 of 2.9K
919
University of California, Berkeley
Berkeley, United States
37 h-index
129 publications
14.9K citations

Centre National de la Recherche Scientifique
Paris, France
32 h-index
111 publications
10K citations
Carnegie Mellon University
Pittsburgh, United States
30 h-index
86 publications
6.3K citations

University of Toronto
Toronto, Canada
29 h-index
98 publications
7K citations
Princeton University
Princeton, United States
27 h-index
93 publications
17.4K citations
University of Michigan
Ann Arbor, United States
27 h-index
94 publications
6.8K citations
University of Bremen
Bremen, Germany
24 h-index
135 publications
5.1K citations
Stanford University
Stanford, United States
23 h-index
73 publications
8.5K citations
1–8 of 919
38 publications · 3.1K citations
25
h-index
JAIR · 32 publications · 2.8K citations
23
h-index
Repository · 50 publications · 1.6K citations
22
h-index
31 publications · 2.4K citations
21
h-index
29 publications · 1.4K citations
20
h-index
1–5