Boolean Constraint Satisfaction
Boolean Constraint Satisfaction is a constraint satisfaction problem in which the domain of each variable is restricted to Boolean values, and the constraints are expressed as logical relations over these variables.
171
Publications
7.7K
Citations
324
Authors
183
Institutions
Publications per year
2017–2026
21
Parents
171
The Approximability of Constraint Satisfaction Problems
Sanjeev Khanna, Madhu Sudan, Luca Trevisan et al. · SIAM Journal on Computing · 2001 · 206 citations
1–5 of 171
324
9
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 324
183

University of Toronto
Toronto, Canada
8 h-index
10 publications
227 citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
18 publications
915 citations
University of California, Berkeley
Berkeley, United States
8 h-index
15 publications
249 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
9 publications
262 citations
University of Oxford
Oxford, United Kingdom
5 h-index
9 publications
351 citations

Durham University
Durham, United Kingdom
5 h-index
6 publications
247 citations

TU Wien
Vienna, Austria
4 h-index
10 publications
233 citations

Université Toulouse III - Paul Sabatier
Toulouse, France
4 h-index
7 publications
152 citations
1–8 of 183
6 publications · 588 citations
6
h-index
Repository · 5 publications · 81 citations
5
h-index
5 publications · 124 citations
5
h-index
6 publications · 407 citations
5
h-index
Repository · 5 publications · 69 citations
5
h-index
1–5