CAP
2010
13 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
WG
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...