Generating set-based black-box group algorithm for abelianness testing

Idea and outline
The algorithm combines two algorithms:


 * 1) It first finds a generating set of size at most $$\log_2N$$ using the black-box group algorithm for small generating set-finding problem. The time taken for this is $$O(N\log_2^2N)$$ times the time for group operations.
 * 2) It then applies the black-box group algorithm for abelianness testing given a generating set.