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

Eric Allender; Jia Jiao; Meena Mahajan; V. Vinay

doi:10.1016/s0304-3975(97)00227-2

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Eric Allender Jia Jiao Meena Mahajan V. Vinay

Year: 1998 Journal: Theoretical Computer Science Vol: 209 (1-2)Pages: 47-86 Publisher: Elsevier BV

DOI: 10.1016/s0304-3975(97)00227-2

Get Full-Text PDF Get Analytical Report

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

Cited By

0.00

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Topics

Related Documents

Lower bounds for bounded depth arithmetic circuits

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

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

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