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

DOI10.1016/0166-218X(93)90105-WMaRDI QIDQ1308741zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Read-Once Functions Revisited and the Readability Number of a Boolean Function
• scientific article; zbMATH DE number 176867
• Read-once functions of the algebra of logic in pre-elementary bases

Cites work

• scientific article; zbMATH DE number 3545568 (Why is no real title available?)
• A note on the production of matroid minors
• Combinatorial characterization of read-once formulae
• On a property of the class of n-colorable graphs
• The Forbidden Minors of Binary Clutters

Cited in

(10)

• Linear read-once and related Boolean functions
• scientific article; zbMATH DE number 176867 (Why is no real title available?)
• Using relevance queries for identification of read-once functions
• Certificates of Non-Membership for Classes of Read-Once Functions
• Combinatorial characterization of read-once formulae
• Iterated Boolean functions in the elementary basis
• On read-once functions over \(\mathbb{Z}_3\)
• A new proof of Stetsenko's theorem
• On the readability of monotone Boolean formulae
• Read-once functions of the algebra of logic in pre-elementary bases

This page was built for publication: Functions that are read-once on a subset of their inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308741)