Complexity Analysis

Complexity Analysis is a methodological framework within logic programming that characterizes the computational resources required by a program or algorithm, distinguished by its formal evaluation of time, space, or other complexity measures with respect to input size and logical inference steps.

1.9K

Publications

96.7K

Citations

4.8K

Authors

1.6K

Institutions

Publications per year

2017–2026

540

Authors

4.8K

  1. HN
    Hamidreza Namazi

    Monash University Malaysia, Malaysia

    21 publications · 673 citations

    18

    h-index

  2. JM
    Junhai Ma

    Tianjin University, China

    11 publications · 456 citations

    11

    h-index

  3. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    10 publications · 359 citations

    10

    h-index

  4. GM
    Georg Moser

    Universität Innsbruck, Austria

    9 publications · 269 citations

    9

    h-index

  5. PR
    Peter Richtárik

    University of Edinburgh, United Kingdom

    8 publications · 249 citations

    8

    h-index

1–5 of 4.8K

Venues

  1. arXiv (Cornell University)

    Repository · 47 publications · 1.7K citations

    21

    h-index

  2. IEEE Transactions on Communications

    25 publications · 1.2K citations

    20

    h-index

  3. SIAM Journal on Optimization

    24 publications · 1.9K citations

    18

    h-index

  4. IEEE Transactions on Vehicular Technology

    22 publications · 757 citations

    17

    h-index

  5. IEEE Transactions on Signal Processing

    19 publications · 798 citations

    16

    h-index

1–5