Exploring Countably Categorical Structures & Their Computational Complexity π
Join Manuel Bodirsky's insightful lecture on countably categorical structures and their implications for computational complexity, part of the Hausdorff Trimester Program on Universality and Homogeneity.

Hausdorff Center for Mathematics
365 views β’ Oct 28, 2013

About this video
Manuel Bodirskys lecture was held within the framework of the Hausdorff Trimester Program Universality and Homogeneity during the workshop on Homogeneous Structures (28.10.2013)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
365
Duration
53:09
Published
Oct 28, 2013
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.