A lower bound for the computational complexity of a set of disjunctives in a monotone basis
type: Item
instance of: scholarly article
title: A lower bound for the computational complexity of a set of disjunctives in a monotone basis
zbMATH Open document ID: 0449.94031
DOI: 10.1007/BF01404101
published in: Journal of Soviet Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3704500
zbMATH Keywords: disjuntives
zbMATH Keywords: monotone basis
zbMATH Keywords: circuit complexity
zbMATH Keywords: functional elements
zbMATH Keywords: monotone Boolean function
author: Dima Grigoriev
MaRDI profile type: Publication
cites work: The Power of Negative Thinking in Multiplying Boolean Matrices
cites work: Q5615283
full work available at URL: https://doi.org/10.1007/bf01404101
OpenAlex ID: W1972009093
description: scientific article; zbMATH DE number 3704500