Sciweavers

CAP
2010
13 years 6 months ago
Parallel computation of the minimal elements of a poset
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...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
WG
2007
Springer
14 years 5 months ago
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
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...
Matthias Hagen