A direct version of Shamir and Snir's lower bounds on monotone circuit depth
type: Item
instance of: scholarly article
title: A direct version of Shamir and Snir's lower bounds on monotone circuit depth
zbMATH Open document ID: 0795.68102
DOI: 10.1016/0020-0190(94)90061-2
author: Prasoon Tiwari
author: Martin Tompa
published in: Information Processing Letters
publication date: 1994-04-05T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 540897
zbMATH Keywords: arithmetic circuits
zbMATH Keywords: formula depth
zbMATH Keywords: parallel algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90061-2
OpenAlex ID: W2080529336
cites work: On the depth complexity of formulas
cites work: Negation can be exponentially powerful
description: scientific article; zbMATH DE number 540897