Summary

Keywords

6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014 brouwer's fixed point theorem directed parity argument economic game nash equilibrium nash's theorem ppad sperner's lemma total search problem

Full Transcript

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: http://ocw.mit.edu/6-890F14 Instructor: Erik Demaine, Constantinos Daskalakis In this first of two guest lectures by Prof. Constantinos Daskalakis of CSAIL, Daskalakis talks about the class PPAD, illustrating connections to economic game theory, topology, and graph theory. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

Direção de Arte no Cinema e Jogos: Fundamentos Essenciais

Transforme sua criatividade em carreira: descubra os segredos da Direção de Arte no cinema, jogos e design gráfico com especialistas e aprenda a criar mundos visuais incríveis. Inscreva-se agora e revolucione sua visão artística!

⭐ 4.0

29 ratings

0 min

30-Day Beginner Guitar Challenge for New Players

Master the Guitar in 30 Days: Your Ultimate Beginner Challenge! Unleash your inner guitarist with step-by-step lessons designed to transform you from novice to confident player. Join Your Guitar Academy and kickstart your musical journey today!

⭐ 4.3

36 ratings

7 hours