Monotone dualization
id:
monotone-dualization-303-17343635
title:
Monotone dualization
text:
In theoretical computer science, monotone dualization is a computational problem of constructing the dual of a monotone Boolean function. Equivalent problems can also be formulated as constructing the transversal hypergraph of a given hypergraph, of listing all minimal hitting sets of a family of sets, or of listing all minimal set covers of a family of sets. These problems can be solved in quasi-polynomial time in the combined size of its input and output, but whether they can be solved in poly
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Monotone_dualization
date created:
date modified:
2024-01-05T23:42:15Z
main entity:
{"identifier":"Q123347707","url":"https://www.wikidata.org/entity/Q123347707"}
image:
fields total:
13
integrity:
13