On Berge Multiplication for Monotone Boolean Dualization

DOI10.1007/978-3-540-70575-8_5MaRDI QIDQ3521907zbMATH OpenOpenAlexFDO

Authors Endre Boros, Kazuhisa Makino, Khaled Elbassioni

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Left-to-right multiplication for monotone Boolean dualization
• On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
• Computational aspects of monotone dualization: a brief survey
• Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
• Recognition and dualization of disguised bidual Horn functions.

Cited in

(5)

• Lower bounds for three algorithms for transversal hypergraph generation
• Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
• Fast algorithms for implication bases and attribute exploration using proper premises
• Left-to-right multiplication for monotone Boolean dualization
• On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization

This page was built for publication: On Berge Multiplication for Monotone Boolean Dualization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521907)