[КТИ-2016]: Survey of some recent results in algebraic complexity

Amir Shpilka - Tel Aviv University Algebraic complexity studies the complexity of computing polynomials by arithmetic circuits - i.e. circuits that use the arithmetic operations ,*. Arithmetic circuits form a very elegant model of computation in which the (analog of the) P vs. NP problem may be easier to attack. In recent years algebraic complexity has gained a lot of interest and some breakthrough results were obtained. In this talk we will mention those breakthrough results and discuss some of the recent