Pages that link to "Item:Q1861581"
From MaRDI portal
The following pages link to Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581):
Displaying 12 items.
- A study on monotone self-dual Boolean functions (Q523743) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Left-to-Right Multiplication for Monotone Boolean Dualization (Q5390600) (← links)
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540) (← links)
