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

Authors

15

  1. XG
    Xiangyu Gao

    Harbin Institute of Technology, China

    1 publications · 10 citations

    1

    h-index

  2. MG
    Michael Gnewuch

    Christian-Albrechts-Universität zu Kiel, Germany

    1 publications · 13 citations

    1

    h-index

  3. GX
    Guiqiao Xu

    Tianjin Normal University, China

    1 publications · 15 citations

    1

    h-index

  4. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    1 publications · 97 citations

    1

    h-index

  5. XL
    Xianmin Liu

    Harbin Institute of Technology, China

    1 publications · 10 citations

    1

    h-index

1–5 of 15

Venues

  1. Journal of Complexity

    3 publications · 81 citations

    3

    h-index

  2. Information Processing Letters

    1 publications · 375 citations

    1

    h-index

  3. Journal of Discrete Algorithms

    1 publications · 97 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 10 citations

    1

    h-index

1–4