I know that you can use other non-solvable groups, but is there a proof that uses a completely different approach?In case someone would not know the theorem:http://en.wikipedia.org/wiki/NC_(complexity)#Barrington.27s_theorem
Are there other proofs for Barrington's theorem?
circuit complexity;gr.group theory;formulas