On Isoperimetric Profiles and Computational Complexity

Tulasi mohan Molli
Nikhil S Mande
Friday, 25 Nov 2016, 16:00 to 17:30
A-201 (STCS Seminar Room)
The isoperiemtric profile of a Graph is a function that measures, for an integer k, is the size of the smallest edge boundary over all sets of vertices of size k.

Arithmetic circuits and Branching programs are two computational models for computing polynomials. Branching programs can be efficiently simulated by Circuits. But, we don't know if Circuits are strictly more powerful than branching programs.

In this talk, we will see the usage of isoperimetric profiles to prove a sharp super-polynomial separation between monotone arithmetic circuits and monotone arithmetic branching programs. This is a result of Hrubes and Yehudayoff [ICALP 2016].

A key ingredient in the proof is an accurate analysis of isoperimetric profile of finite full binary trees.