Functions computed by monotone Boolean formulas with no repeated variables
type: Item
instance of: scholarly article
title: Functions computed by monotone Boolean formulas with no repeated variables
zbMATH Open document ID: 0674.94025
DOI: 10.1016/0304-3975(89)90150-3
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 4104872
zbMATH Keywords: monotone Boolean function
zbMATH Keywords: prime implicant
zbMATH Keywords: prime clause
zbMATH Keywords: matroid theory
author: Daniele Mundici
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90150-3
OpenAlex ID: W2091937709
cites work: Greedy packing and series-parallel graphs
cites work: Q3742714
cites work: A Solution of the Shannon Switching Game
cites work: Q3684036
cites work: Q4138141
cites work: The Recognition of Series Parallel Digraphs
cites work: Q3762226
cites work: Q4111952
cites work: Theory of Matroids
Recommended article: Q3705497
Recommended article: Q3335687
Recommended article: Generation of Boolean functions under the assumption of monotonicity
Recommended article: Q3352968
Recommended article: Monotone Boolean functions
Recommended article: On the nonlinearity of monotone Boolean functions
Recommended article: Q3200990
Recommended article: Q4406630
Recommended article: The reduction of general Boolean functions to monotonic form
Recommended article: Influences of monotone Boolean functions
description: scientific article; zbMATH DE number 4104872