Computer science(CS) has emerged in last 40+ years to be a branch of science on its own. The concerns in CS involve all the way from fundamentals of mathematics to designing usable social networking apps.

Around a week ago, a group of researchers* proved that the randomized query complexity of f composed with g is lower bounded by the product of the randomized query complexities of f and g, albeit with suboptimal parameters.

In this talk, we will see a proof of the snake lemma. The talk will assume a basic familiarity (group homomorphisms, kernels, cokernels, etc.) with group theory.

During academic collaborations, we have different people working on a paper and the draft has a natural evolution. Most people are ok using a sync service like dropbox, or even just emailing tex sources to each other (gasp).