Lower bounds on arithmetic circuits via partial derivatives
type: Item
instance of: scholarly article
title: Lower bounds on arithmetic circuits via partial derivatives
zbMATH Open document ID: 0890.68074
DOI: 10.1007/BF01294256
author: Noam Nisan
author: A. Wigderson
published in: Computational Complexity
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1109554
zbMATH Keywords: circuit complexity
zbMATH Keywords: arithmetic circuits
zbMATH Keywords: complexity measure for multivariate polynomials
MaRDI profile type: Publication
cites work: A Certain Class of Incidence Matrices
cites work: On the depth complexity of formulas
cites work: A direct version of Shamir and Snir's lower bounds on monotone circuit depth
cites work: Negation can be exponentially powerful
cites work: Fast Parallel Computation of Polynomials Using Few Processors
full work available at URL: https://doi.org/10.1007/bf01294256
OpenAlex ID: W2171403864
description: scientific article; zbMATH DE number 1109554