Complexity of Some Topological Inference Problems

Tuesday, October 8, 2013 - 2:00pm - 2:50pm
Keller 3-180
Shmuel Weinberger (University of Chicago)
I will discuss some stylized topological inference problems and give some information about Kolmogorov, sample and computational complexity. I will then discuss some tentative first steps towards a theory of feasibly computable invariants.
MSC Code: