Functions computed by monotone Boolean formulas with no repeated variables

DOI10.1016/0304-3975(89)90150-3zbMath0674.94025OpenAlexW2091937709MaRDI QIDQ1121854

Daniele Mundici

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90150-3

zbMATH Keywords

prime implicantmatroid theorymonotone Boolean functionprime clause

Mathematics Subject Classification ID

Related Items (8)

On lengths of edge-labeled graph expressions ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ Solution of Rota's problem on the order of series-parallel networks ⋮ Computer science and decision theory ⋮ Decision lists and related Boolean functions ⋮ Double Horn functions ⋮ Theory revision with queries: Horn, read-once, and parity formulas ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs

Cites Work

• Greedy packing and series-parallel graphs
• The Recognition of Series Parallel Digraphs
• A Solution of the Shannon Switching Game
• Theory of Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Functions computed by monotone Boolean formulas with no repeated variables