Q3762226
type: Item
instance of: scholarly article
zbMATH Open document ID: 0623.94018
author: Ingo Wegener
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4012495
zbMATH Keywords: computational complexity
zbMATH Keywords: Boolean formula
zbMATH Keywords: parallel computations
zbMATH Keywords: complexity of Boolean functions
zbMATH Keywords: computation models
zbMATH Keywords: Boolean circuits
zbMATH Keywords: minimization
zbMATH Keywords: combinational complexity
zbMATH Keywords: lower bound
zbMATH Keywords: circuit complexity
zbMATH Keywords: nonuniform complexity measures
zbMATH Keywords: Turing machines
zbMATH Keywords: monotone circuits
zbMATH Keywords: bounded-depth circuits
zbMATH Keywords: synchronous circuits
zbMATH Keywords: planar circuits
zbMATH Keywords: parallel random access machines
zbMATH Keywords: branching programs
MaRDI profile type: Publication
Recommended article: Computational complexity of Boolean functions
Recommended article: Q4692286
Recommended article: The complexity of Boolean functions in different characteristics
Recommended article: Q4323983
Recommended article: On complexity of a particular Boolean functions class
Recommended article: Q3832047
Recommended article: Boolean function complexity. Advances and frontiers.
Recommended article: On the Multiplicative Complexity of Boolean Functions
Recommended article: On the complexity of restrictions of Boolean functions
Recommended article: Multiplicative complexity of some Boolean functions
description: scientific article