Pages that link to "Item:Q4337435"

The following pages link to Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle (Q4337435):

Displaying 19 items.

• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
• A study on monotone self-dual Boolean functions (Q523743) (← links)
• 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)
• Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
• On the existence of a minimum integer representation for weighted voting systems (Q1026570) (← links)
• Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482) (← links)
• Guided inference of nested monotone Boolean functions (Q1810471) (← 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)
• Complete voting systems with two classes of voters: weightedness and counting (Q1931640) (← links)
• On the enumeration of Boolean functions with distinguished variables (Q2100402) (← links)
• Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
• On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
• On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
• Generating dual-bounded hypergraphs (Q4405941) (← links)
• Tree-shellability of Boolean functions (Q5958139) (← links)