1.Previous
3.Next

In computational complexity theory and cryptography, an index set is a set for which there exists an algorithm that can sample the set efficiently; e.g., on input , can efficiently select a poly(n)-bit long element from the set.