# Question

Show that if (S, ℓ) is a matroid, then (S, ℓ′) is a matroid, where
ℓ′ = {A′: S - A′ contains some maximal A ¬ℓ}.

That is, the maximal independent sets of (S, ℓ′) are just the complements of the maximal independent sets of (S, ℓ).

That is, the maximal independent sets of (S, ℓ′) are just the complements of the maximal independent sets of (S, ℓ).

## Answer to relevant Questions

Give a dynamic-programming solution to the 0–1 knapsack problem that runs in O (n W) time, where n is number of items and W is the maximum weight of items that the thief can put in his knapsack.A sequence of stack operations is performed on a stack whose size never exceeds k. After every k operations, a copy of the entire stack is made for backup purposes. Show that the cost of n stack operations, including copying ...Suppose that all edge weights in a graph are integers in the range from 1 to |V|. How fast can you make Prim’ s algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?Define and operator that, given a rational number, returns the cube of that number,What do you understand by the term cardinality?Post your question

0