Size-Depth Tradeoffs for Algebraic Formulas
From MaRDI portal
Publication:4852620
DOI10.1137/S0097539792232586zbMath0830.68044MaRDI QIDQ4852620
Nader H. Bshouty, Wayne Eberly, Richard Cleve
Publication date: 1 November 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators ⋮ Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas ⋮ Types of depth and formula size ⋮ A generalization of Spira's theorem and circuits with small segregators or separators ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Random arithmetic formulas can be reconstructed efficiently
This page was built for publication: Size-Depth Tradeoffs for Algebraic Formulas
