Types of depth and formula size

DOI10.1142/S1793557114500314zbMath1342.68363MaRDI QIDQ2920906

No author found.

Publication date: 29 September 2014

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

depthdeterminantformula size

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Arithmetic Circuits: A survey of recent results and open questions
• A Lower Bound for the Formula Size of Rational Functions
• Fast Parallel Matrix Inversion Algorithms
• The Parallel Evaluation of General Arithmetic Expressions
• Fast parallel matrix and GCD computations
• Size-Depth Tradeoffs for Algebraic Formulas
• Depth-3 arithmetic circuits over fields of characteristic zero

This page was built for publication: Types of depth and formula size