(IMAGE)
Caption
This figure shows that the search space size of the index selection problem causes a combinatorial explosion, where any K elements are selected from M elements and assigned log2(Q) bits of information. Even for a simple case like (M, K, Q) = (16, 8, 64), there are about 6.94 * 10^{173} candidates, which is very hard to solve.
Credit
Yokohama National University
Usage Restrictions
The image may only be used with appropriate caption or credit.
License
Original content