Having a hard time following the lower bound proof, especially this part:
> By the definition of ππ , we know there are at least as many programs in ππ as there are artefacts in π (πΊ), i.e. |ππ | β₯ #π (πΊ).
I'm not sure how the definition of P_a leads to |p_a| >= #\pi(G)...
> By the definition of ππ , we know there are at least as many programs in ππ as there are artefacts in π (πΊ), i.e. |ππ | β₯ #π (πΊ).
I'm not sure how the definition of P_a leads to |p_a| >= #\pi(G)...