Almost Sure Fixed-parameter Tractability
Almost Sure Fixed-Parameter Tractability is a probabilistic refinement of fixed-parameter tractability in parameterized complexity theory, where an algorithm is said to solve a parameterized problem in expected fixed-parameter time with probability approaching one over a distribution of inputs.
6
Publications
563
Citations
15
Authors
12
Institutions
Publications per year
2017–2026
1
Parents
6
1–5 of 6
15
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
12

University of Warsaw
Warsaw, Poland
2 h-index
2 publications
66 citations
University of Kentucky
Lexington, United States
1 h-index
1 publications
53 citations
Tianjin Normal University
Tianjin, China
1 h-index
1 publications
15 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
97 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
375 citations

Harbin Institute of Technology
Harbin, China
1 h-index
4 publications
40 citations

Beijing Normal University
Beijing, China
1 h-index
2 publications
30 citations

Christian-Albrechts-Universität zu Kiel
Kiel, Germany
1 h-index
1 publications
13 citations
1–8 of 12
3 publications · 81 citations
3
h-index
1 publications · 375 citations
1
h-index
1 publications · 97 citations
1
h-index
1 publications · 10 citations
1
h-index
1–4