Complexity of Boolean functions over bases with unbounded fan-in gates
type: Item
instance of: scholarly article
title: Complexity of Boolean functions over bases with unbounded fan-in gates
zbMATH Open document ID: 0875.68790
DOI: 10.1016/0020-0190(95)00182-4
author: Vlado Dančík
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984141
zbMATH Keywords: Boolean functions
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00182-4
OpenAlex ID: W1995176744
cites work: Q3994882
cites work: Q3249579
cites work: Q4138141
cites work: Q3762226
description: scientific article; zbMATH DE number 984141