Experimental comparison of the two Fredman-Khachiyan-algorithms

DOI10.1137/1.9781611972894.15MaRDI QIDQ5233575zbMATH OpenOpenAlexFDO

Authors Matthias Hagen, Peter Horatschek, Martin Mundhenk

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972894.15

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 7286679
• On the fixed-parameter tractability of the equivalence test of monotone normal forms
• Computational aspects of monotone dualization: a brief survey
• Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
• A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

Cited in

(6)

• On the fixed-parameter tractability of the equivalence test of monotone normal forms
• The minimal hitting set generation problem: algorithms and computation
• How to apply SAT-solving for the equivalence test of monotone normal forms
• On quantifying literals in Boolean logic and its applications to explainable AI
• scientific article; zbMATH DE number 7286679 (Why is no real title available?)
• New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems

This page was built for publication: Experimental comparison of the two Fredman-Khachiyan-algorithms

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