Arithmetic Circuit Complexity

Arithmetic Circuit Complexity is a branch of computational complexity theory that studies the minimum number of arithmetic operations required to compute a given polynomial using directed acyclic graphs composed of gates representing field additions and multiplications, distinguished from Boolean circuit complexity by its focus on algebraic computations over infinite fields.

370

Publications

19.8K

Citations

573

Authors

277

Institutions

Publications per year

2017–2026

38

Variants

Algebraic Circuit Complexity

Authors

573

  1. NK
    Neeraj Kayal

    Microsoft Research (India), India

    11 publications · 407 citations

    10

    h-index

  2. HJ
    Håkan Johansson

    Linköping University, Sweden

    9 publications · 327 citations

    9

    h-index

  3. MH
    M.A. Hasan

    University of Waterloo, Canada

    9 publications · 790 citations

    9

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    8 publications · 435 citations

    8

    h-index

  5. OG
    Oscar Gustafsson

    Linköping University, Sweden

    8 publications · 354 citations

    8

    h-index

1–5 of 573

Venues

  1. IEEE Transactions on Computers

    37 publications · 2.6K citations

    23

    h-index

  2. SIAM Journal on Computing

    21 publications · 1.4K citations

    20

    h-index

  3. Journal of the ACM

    JACM · 8 publications · 513 citations

    8

    h-index

  4. IEEE Transactions on Signal Processing

    8 publications · 348 citations

    8

    h-index

  5. arXiv (Cornell University)

    Repository · 8 publications · 175 citations

    8

    h-index

1–5