Pages that link to "Item:Q5449540"
From MaRDI portal
The following pages link to On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540):
Displaying 9 items.
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578) (← links)
- Left-to-Right Multiplication for Monotone Boolean Dualization (Q5390600) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492876) (← links)