Lower bounds on monotone arithmetic circuits with restricted depths

DOI10.1016/0898-1221(85)90103-8zbMath0584.94025OpenAlexW2012759468MaRDI QIDQ1070999

B. George

Publication date: 1985

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90103-8

zbMATH Keywords

exponential lower boundsalmost-matching boundsmonotone multivariate polynomials

Mathematics Subject Classification ID

Cites Work

• Negation can be exponentially powerful
• Fast Parallel Computation of Polynomials Using Few Processors
• On the depth complexity of formulas
• Some Exact Complexity Results for Straight-Line Computations over Semirings

This page was built for publication: Lower bounds on monotone arithmetic circuits with restricted depths