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

Guillaume Lagarde; Nutan Limaye; Srikanth Srinivasan

doi:10.4230/lipics.mfcs.2017.41

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Guillaume Lagarde Nutan Limaye Srikanth Srinivasan

Year: 2018 Journal: Computational Complexity Vol: 28 (3)Pages: 471-542 Publisher: Birkhäuser

DOI: 10.4230/lipics.mfcs.2017.41

Get Full-Text PDF Get Analytical Report

Keywords:

Monomial Commutative property Mathematics Discrete mathematics Commutative ring Electronic circuit Polynomial ring Polynomial Parsing Arithmetic Combinatorics Computer science Mathematical analysis Artificial intelligence

Metrics

Cited By

0.50

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

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

Lower bounds on monotone arithmetic circuits with restricted depths

Non-commutative arithmetic circuits with division

Lower Bounds for Planar Arithmetic Circuits

Lower bounds for bounded depth arithmetic circuits