Combinatorial Reasoning
Combinatorial Reasoning is a form of mathematical reasoning that involves deriving conclusions about discrete structures through systematic analysis of finite sets, permutations, combinations, and their interrelations, distinguished from other branches of mathematical reasoning by its focus on enumeration, arrangement, and combinatorial proof techniques.
134
Publications
7.9K
Citations
252
Authors
141
Institutions
Publications per year
2017–2026
26
Parents
134
Automated Algorithm Selection: Survey and Perspectives
Pascal Kerschke, Holger H. Hoos, Frank Neumann et al. · Evolutionary Computation · 2018 · 401 citations · Full text
On the combinatorial problems which I would most like to see solved
P. Erdös · COMBINATORICA · 1981 · 321 citations
Backdoors to typical case complexity
Ryan Williams, Carla P. Gomes, Bart Selman · 2003 · 316 citations
1–5 of 134
252
7
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 252
141
Oregon State University
Corvallis, United States
6 h-index
9 publications
277 citations
University of Oxford
Oxford, United Kingdom
4 h-index
6 publications
361 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
323 citations

University of Toronto
Toronto, Canada
4 h-index
7 publications
156 citations
Ben-Gurion University of the Negev
Beersheba, Israel
3 h-index
6 publications
98 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
71 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
3 h-index
3 publications
77 citations

University of St Andrews
St Andrews, United Kingdom
3 h-index
6 publications
602 citations
1–8 of 141
4 publications · 179 citations
4
h-index
3 publications · 90 citations
3
h-index
3 publications · 46 citations
3
h-index
JMB · 3 publications · 126 citations
3
h-index
JRST · 3 publications · 47 citations
3
h-index
1–5