Lower bounds to the complexity of symmetric Boolean functions
type: Item
instance of: scholarly article
title: Lower bounds to the complexity of symmetric Boolean functions
zbMATH Open document ID: 0701.68044
DOI: 10.1016/0304-3975(90)90080-2
author: Pavel Pudlák
author: Vojtěch Rödl
author: László Babai
author: Endre Szemerédi
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4149558
zbMATH Keywords: lower bounds
zbMATH Keywords: complexity
zbMATH Keywords: symmetric Boolean functions
zbMATH Keywords: branching programs
MaRDI profile type: Publication
full work available at URL: 0304-3975(90)90080-2
OpenAlex ID: W2038529163
cites work: $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
cites work: Q5545524
cites work: Q3690219
cites work: Q3762226
description: scientific article; zbMATH DE number 4149558