34:41JFDM-TC/69 12b-3: แนะนำ decider และพิสูจน์ว่าปัญหา undecidable ด้วย reductionJittat Fakcharoenphol
59:41ICZeros of polynomials, decay of correlations, and algorithms by Piyush SrivastavaInternational Centre for Theoretical SciencesAdvanced
1:30:27FOHighlander’s Lecture Series – Military AI, Lethal Autonomous Weapons, and Enhanced SoldiersFaculty of Arts — University of Calgary
1:08:19SISemidefinite Programming Hierarchies I: Convex Relaxations for Hard Optimization ProblemsSimons Institute for the Theory of ComputingAdvanced
1:17:54HCRico Zenklusen: Approximation algorithms for hard augmentation problems, lecture IIIHausdorff Center for MathematicsAdvanced
38:05HPInaugural Lecture by Prof. Hubert P. H. Shum - Spatial-Temporal Modelling for Visual ComputingHubert P. H. Shum
12:43ICPhases, morphologies, and transitions in a mathematical by Jaya Kumar AInternational Centre for Theoretical Sciences
7:31WEIntroduction à la calculabilité - La machine de Turing (1/2) | Rachid GuerraouiWandida, EPFLIntro
1:05:57IFEfficient Batch Verification: Recent Progress and Challenges - Ron RothblumInstitute for Advanced StudyAdvanced
1:23:45IHJoel Hass - Lecture 2 - Algorithms and complexity in the theory of knots and manifolds - 19/06/18Institut Henri PoincaréAdvanced