Pages that link to "Item:Q1853168"
From MaRDI portal
The following pages link to Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168):
Displaying 13 items.
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← 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)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)
