Polynomial time algorithm for dualizing a monotone DNF

点击翻译按钮获取中文摘要

The goal of this research project was to develop an algorithm for dualizing a boolean function given in DNF, that runs in time polynomial in the total size of the input and output. This problem is equivalent to the problem of generating all the minimal transversals of a given hypergraph. We were unable to achieve this ultimate goal. However, we discovered an algorithm for generating all the minimal transversals of a hypergraph using O (n log n) words of storage, where n is the size of the input hypergraph. The time complexity of this algorithm is quasi-polynomial and almost the same as the best known algorithm due to Fredman and Khachiyan. We have also discovered a polynomial time delay algorithm for generating all the minimal transversals of a given bounded-degree hypergraph.