Noncommutative Algebra Computation

Noncommutative Algebra Computation is a computational framework in computational algebra that specifically addresses the algorithmic manipulation and symbolic computation of algebraic structures in which multiplication is not necessarily commutative, distinguishing it from methods restricted to commutative rings and algebras.

37

Publications

1.2K

Citations

69

Authors

34

Institutions

Publications per year

2017–2026

6

Authors

69

  1. GI
    Gábor Ivanyos

    Hungarian Academy of Sciences, Hungary

    4 publications · 95 citations

    4

    h-index

  2. YQ
    Youming Qiao

    University of Technology Sydney, Australia

    3 publications · 83 citations

    3

    h-index

  3. KV
    K. V. Subrahmanyam

    Chennai Mathematical Institute, India

    3 publications · 83 citations

    3

    h-index

  4. JW
    J. William Helton

    University of California San Diego, United States

    2 publications · 44 citations

    2

    h-index

  5. VA
    V. Arvind

    Institute of Mathematical Sciences, India

    2 publications · 37 citations

    2

    h-index

1–5 of 69

Venues

  1. SIAM Journal on Computing

    4 publications · 235 citations

    4

    h-index

  2. Computational Complexity

    CC · 2 publications · 81 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 26 citations

    2

    h-index

  4. Mathematics of Computation

    MCOM · 2 publications · 50 citations

    2

    h-index

  5. Foundations of Computational Mathematics

    1 publications · 16 citations

    1

    h-index

1–5