Application of separability and independence notions for proving lower bounds of circuit complexity
type: Item
instance of: scholarly article
title: Application of separability and independence notions for proving lower bounds of circuit complexity
zbMATH Open document ID: 0449.94030
DOI: 10.1007/BF01693976
published in: Journal of Soviet Mathematics
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3704499
zbMATH Keywords: lower bounds of circuit complexity
zbMATH Keywords: Boolean functions
zbMATH Keywords: combinational circuit
zbMATH Keywords: algebraic complexity of linear forms
author: Dima Grigoriev
MaRDI profile type: Publication
cites work: Berechnung und Programm. I
cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
cites work: Q5341481
cites work: Q5515914
full work available at URL: https://doi.org/10.1007/bf01693976
OpenAlex ID: W2119106791
description: scientific article; zbMATH DE number 3704499