Lower bounds on the area complexity of Boolean circuits
type: Item
instance of: scholarly article
title: Lower bounds on the area complexity of Boolean circuits
zbMATH Open document ID: 0769.68045
DOI: 10.1016/0304-3975(92)90079-U
author: S. A. Lozhkin
author: Andrej I. Rybko
author: Nadežda A. Škalikova
author: Juraj Hromkovič
author: Alexander Sapozhenko
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 65312
zbMATH Keywords: Boolean circuits
zbMATH Keywords: Boolean functions
zbMATH Keywords: communication complexity
zbMATH Keywords: lower bound
zbMATH Keywords: area complexity
zbMATH Keywords: layout
MaRDI profile type: Publication
cites work: Q3050321
cites work: A result on k-valent graphs and its application to a graph embedding problem
cites work: Linear lower bounds on unbounded fan-in Boolean circuits
cites work: The advantages of a new approach to defining the communication complexity for VLSI
cites work: Q3787930
cites work: Q3343924
cites work: Q5333608
cites work: Q3684036
cites work: Q3684035
cites work: The planar realization of Boolean functions
cites work: Communication complexity
cites work: Q4138141
cites work: Q3664988
cites work: Q3326832
cites work: Q3221885
Wikidata QID: Q126789386
Recommended article: Lower bounds for Boolean circuits of bounded negation width
Recommended article: Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Recommended article: Lower bounds for unrestricted Boolean circuits: open problems
Recommended article: Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
Recommended article: Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
Recommended article: Lower bounds for the complexity of restrictions of Boolean functions
Recommended article: Explicit lower bound of 4.5n - o(n) for boolena circuits
Recommended article: Q4850550
Recommended article: Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
Recommended article: Q4850554
description: scientific article; zbMATH DE number 65312