## Lower bounds for homogeneous depth-5 arithmetic circuits over finite fields

Mrinal Kumar

March 14, 2016

The last few years have seen substantial progress on the question of proving lower bounds for homogeneous depth-4 arithmetic circuits. Even though these results seem to come close to resolving the VP vs VNP question, it seems likely that the techniques involved may not be strong enough for this resolution. However, it is conceivable that we might be able to build upon these ideas to show super-polynomial lower bounds for weaker classes of arithmetic circuits, like arithmetic formula or constant depth circuits.