JOURNAL ARTICLE

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

Guillaume LagardeNutan LimayeSrikanth Srinivasan

Year: 2018 Journal:   Computational Complexity Vol: 28 (3)Pages: 471-542   Publisher: Birkhäuser
Keywords:
Monomial Commutative property Mathematics Discrete mathematics Commutative ring Electronic circuit Polynomial ring Polynomial Parsing Arithmetic Combinatorics Computer science Mathematical analysis Artificial intelligence

Metrics

2
Cited By
0.50
FWCI (Field Weighted Citation Impact)
27
Refs
0.60
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Formal Methods in Verification
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

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

Eric AllenderJia JiaoMeena MahajanV. Vinay

Journal:   Theoretical Computer Science Year: 1998 Vol: 209 (1-2)Pages: 47-86
JOURNAL ARTICLE

Lower bounds on monotone arithmetic circuits with restricted depths

Joseph F. JáJá

Journal:   Computers & Mathematics with Applications Year: 1985 Vol: 11 (12)Pages: 1155-1164
JOURNAL ARTICLE

Lower Bounds for Planar Arithmetic Circuits

Ramya, C.Shastri, Pratik

Journal:   Leibniz-Zentrum für Informatik (Schloss Dagstuhl) Year: 2024
© 2026 ScienceGate Book Chapters — All rights reserved.