Pages that link to "Item:Q3439365"
From MaRDI portal
The following pages link to Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365):
Displaying 12 items.
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Functions that are read-once on a subset of their inputs (Q1308741) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- On read-once multifunctions in some base (Q2058308) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Certificates of Non-Membership for Classes of Read-Once Functions (Q2934873) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- (Q5150421) (← links)
- Recognizing read-once functions from depth-three formulas (Q5915579) (← links)
