Types of depth and formula size
From MaRDI portal
Publication:2920906
DOI10.1142/S1793557114500314zbMATH Open1342.68363MaRDI QIDQ2920906FDOQ2920906
Authors: K. Kalorkoti
Publication date: 29 September 2014
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Recommendations
- Calculating sized types
- Size-Depth Tradeoffs for Algebraic Formulas
- scientific article; zbMATH DE number 5056667
- scientific article; zbMATH DE number 5526052
- Depth, highness and DNR degrees
- Depth, highness and DNR degrees
- Depth Formula via Complete Intersection Flat Dimension
- Enclosing depth and other depth measures
- Size functions
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
- Depth-3 arithmetic circuits over fields of characteristic zero
- Fast parallel matrix and GCD computations
- The Parallel Evaluation of General Arithmetic Expressions
- Size-Depth Tradeoffs for Algebraic Formulas
- Fast Parallel Matrix Inversion Algorithms
- A Lower Bound for the Formula Size of Rational Functions
Cited In (1)
This page was built for publication: Types of depth and formula size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920906)