Pages that link to "Item:Q944714"

The following pages link to An improvement on the complexity of factoring read-once Boolean functions (Q944714):

Displaying 8 items.

• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
• The complexity of AND-decomposition of Boolean functions (Q2181249) (← links)
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
• On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
• (Q3035231) (← links)
• Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
• (Q5150421) (← links)
• Recognizing read-once functions from depth-three formulas (Q5915579) (← links)