Pages that link to "Item:Q1327236"

The following pages link to An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236):

Displaying 17 items.

• A geometric connection to threshold logic via cubical lattices (Q646706) (← links)
• Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
• Influence decision models: from cooperative game theory to social network analysis (Q826316) (← links)
• Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
• Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
• Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
• Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
• Interior and exterior functions of Boolean functions (Q1923581) (← links)
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• A graph approach for fuzzy-rough feature selection (Q2219196) (← links)
• On the Complexity of the Decisive Problem in Simple and Weighted Games (Q2840677) (← links)
• Generating dual-bounded hypergraphs (Q4405941) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)