Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity – Arkadev Chattopadhyay

Computer Science/Discrete Mathematics Seminar I

Topic: Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity
Speaker: Arkadev Chattopadhyay
Affiliation: Tata Institute of Fundamental

Leave a Reply

Your email address will not be published. Required fields are marked *