Skip to main content

Topological Lower Bounds for Computation Trees and Arithmetic Networks

Nicolai Vorobjov ( University of Bath )

Speaker bio

PhD from Leningrad State University in 1984. Has worked as Research Fellow at Leningrad University, Steklov Mathematical Institute of Russian Academy of Sciences, Cornell and Penn State universities. From 1995 in Bath, from Lecturer to Professor.

 

 

Share this: