Past Events


Complete Derandomization of Identity Testing of Read-Once Formulas


Download as iCal file

Wednesday, February 28, 2018, 11:00am


In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+, √ó} and such that every input v

Speaker: Ilya Volkovich


I am a faculty in the Computer Science and Engineering Division at the University of Michigan.Previously, I was a Postdoctoral Research Associate (postdoc) in the Computer Science Department at Princeton University and the School of Mathematics at the I

Location : CoRE 301


Pranjal Awasthi and Shubhangi Saraf

Event Type: Seminar



University of Michigan.