A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Speeding up Dualization in the Fredman-Khachiyan Algorithm B
2018
Symposium on Experimental and Efficient Algorithms
The problem of computing the dual of a monotone Boolean function f is a fundamental problem in theoretical computer science with numerous applications. The related problem of duality testing (given two monotone Boolean functions f and g, declare that they are dual or provide a certificate that shows they are not) has a complexity that is not yet known. However, two quasi-polynomial time algorithms for it, often referred to as F K-A and F K-B, were proposed by Fredman and Khachiyan in 1996, with
doi:10.4230/lipics.sea.2018.6
dblp:conf/wea/SedaghatSC18
fatcat:m4wtqdrosnbsrcc3r32bxkosqy