Kernel Lower Bounds
Kernel Lower Bounds is a theoretical framework in parameterized complexity that establishes limits on the size of kernels by proving that certain problems cannot admit polynomial or smaller kernelizations under widely believed complexity-theoretic assumptions.
298
Publications
14.3K
Citations
505
Authors
302
Institutions
Publications per year
2017–2026
63
Parents
298
1–5 of 298
505
9
h-index
8
h-index
7
h-index
7
h-index
7
h-index
1–5 of 505
302

Centre National de la Recherche Scientifique
Paris, France
11 h-index
17 publications
1.4K citations
Utrecht University
Utrecht, The Netherlands
9 h-index
15 publications
1.2K citations

Royal Holloway University of London
Egham, United Kingdom
8 h-index
16 publications
817 citations
Technische Universität Berlin
Berlin, Germany
6 h-index
11 publications
625 citations
University of Bergen
Bergen, Norway
6 h-index
9 publications
356 citations

Université de Montpellier
Montpellier, France
6 h-index
6 publications
679 citations
University of California, Berkeley
Berkeley, United States
6 h-index
21 publications
1.8K citations
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Montpellier, France
5 h-index
5 publications
483 citations
1–8 of 302
Repository · 18 publications · 548 citations
12
h-index
8 publications · 637 citations
8
h-index
TALG · 6 publications · 476 citations
6
h-index
6 publications · 829 citations
6
h-index
6 publications · 461 citations
6
h-index
1–5