Artificial Intelligence, specifically machine learning (ML), has increasingly been making inroads into society and our lives over the last decade.

Given n-variate polynomials f,g,h such that f=g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s, deg(h)).

In this talk, I will introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system.

Covering Contributions of Abel Laureate Avi Wigderson

Arkadev Chattopadhyay "Games Avi Plays To Prove Hardness"

Prahlad Harsha "How Avi copes with Difficulty: A computational perspective on randomness and knowledge"