On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization

DOI10.1007/11841036_32zbMath1131.68463OpenAlexW1790852663MaRDI QIDQ5449540

Khaled M. Elbassioni

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Related Items (6)

The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Lower bounds for three algorithms for transversal hypergraph generation

This page was built for publication: On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization