Depth reduction for noncommutative arithmetic circuits

DOI10.1145/167088.167226MaRDI QIDQ5248521zbMATH OpenOpenAlexFDO

Authors Jia Jiao, Eric Allender

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167226

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(9)

• Non-commutative arithmetic circuits: depth reduction and size lower bounds
• Properties of probabilistic pushdown automata
• The complexity of computing maximal word functions
• A quasi-polynomial-time algorithm for sampling words from a context-free language
• How hard is computing the edit distance?
• Relationships among $PL$, $\#L$, and the determinant
• Properties of probabilistic pushdown automata
• How hard is to compute the edit distance
• Computing LOGCFL certificates

This page was built for publication: Depth reduction for noncommutative arithmetic circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248521)