2 search results - page 1 / 1 » The complexity of maximum matroid-greedoid intersection and ... |
FCT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
84
Voted
DAM
2006
14 years 10 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...