Computational Complexity Of Decomposition

Computational Complexity of Decomposition is a theoretical measure within algorithmic geometry that characterizes the asymptotic resource requirements, particularly time and space, associated with constructing a cell decomposition of a given space or geometric object.

925

Publications

49.6K

Citations

2.4K

Authors

833

Institutions

Publications per year

2017–2026

201

Authors

2.4K

  1. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    6 publications · 355 citations

    6

    h-index

  2. FV
    Fedor V. Fomin

    University of Bergen, Norway

    6 publications · 358 citations

    6

    h-index

  3. MP
    Michał Pilipczuk

    University of Warsaw, Poland

    6 publications · 355 citations

    6

    h-index

  4. MS
    Micha Sharir

    Tel Aviv University, Israel

    5 publications · 314 citations

    5

    h-index

  5. GB
    Guoan Bi

    Nanyang Technological University, Singapore

    5 publications · 341 citations

    5

    h-index

1–5 of 2.4K

Venues

  1. IEEE Transactions on Signal Processing

    42 publications · 2.5K citations

    23

    h-index

  2. SIAM Journal on Computing

    14 publications · 2.6K citations

    14

    h-index

  3. arXiv (Cornell University)

    Repository · 21 publications · 993 citations

    13

    h-index

  4. IEEE Transactions on Pattern Analysis and Machine Intelligence

    TPAMI · 13 publications · 1.8K citations

    13

    h-index

  5. IEEE Transactions on Antennas and Propagation

    14 publications · 946 citations

    13

    h-index

1–5