JOURNAL ARTICLE

Non-commutative arithmetic circuits: depth reduction and size lower bounds

Eric AllenderJia JiaoMeena MahajanV. Vinay

Year: 1998 Journal:   Theoretical Computer Science Vol: 209 (1-2)Pages: 47-86   Publisher: Elsevier BV
Keywords:
Semiring Mathematics Commutative property Polynomial Discrete mathematics Reduction (mathematics) Arithmetic circuit complexity Degree (music) Electronic circuit Arithmetic Logarithm Complexity class Combinatorics Time complexity Arbitrary-precision arithmetic Mathematical analysis

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
44
Refs
0.03
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees

Guillaume LagardeNutan LimayeSrikanth Srinivasan

Journal:   Computational Complexity Year: 2018 Vol: 28 (3)Pages: 471-542
JOURNAL ARTICLE

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits

Mrinal KumarShubhangi Saraf

Journal:   arXiv (Cornell University) Year: 2013 Vol: 20
BOOK-CHAPTER

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

Mrinal KumarShubhangi Saraf

Lecture notes in computer science Year: 2014 Pages: 751-762
JOURNAL ARTICLE

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

Ingo Wegener

Journal:   Information Processing Letters Year: 1993 Vol: 46 (2)Pages: 85-87
© 2026 ScienceGate Book Chapters — All rights reserved.