Algebraic Complexity Theory is a field in which one studies complexity theoretic questions surrounding algebraic objects. In this talk we will be broadly discussing two such problems.
In a secure multi-party computation problem, players are required to compute a function of their private inputs without revealing any extra information about this input to other players.
Can a sender encode a pair of messages (m0, m1) jointly, and send their encoding over (say) a binary erasure channel, so that the receiver can decode exactly one of the two messages and the sender does not know which one?
