Functions that are read-once on a subset of their inputs

DOI10.1016/0166-218X(93)90105-WzbMath0780.94015OpenAlexW2060728318MaRDI QIDQ1308741

Lisa Hellerstein

Publication date: 30 January 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90105-w

zbMATH Keywords

boolean formulamonotone boolean function

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Combinatorial characterization of read-once formulae
• A note on the production of matroid minors
• On a property of the class of n-colorable graphs
• The Forbidden Minors of Binary Clutters