u/sharewithmein r/compsci • Recommends
Learn a little bit about Games and Puzzles that are NP-Hard. :)
0:00 / 0:00
#erikdemaine#np-hard#computationalcomplexity
Presburger Award 2013 presentation
EATCS
202 subscribers • 1 video on Hallway
- Recommended by 1 person: 1 in engineering communities.
- Presented by Erik Demaine, Professor at MIT
- May be out of date. Uploaded 13 years ago, in an area where tools change fast.
Advanced. Deep dive for people who know the field.
1.2K views13 years ago1 recommendation
Computer scienceGame developmentAlgorithmsComputation and complexityGame design
Erik Demaine presents his research on the computational complexity of games and puzzles during his 2013 Presburger Award talk.
Presburger Award 2013 presentation by Erik Demaine at ICALP 2013, Riga, Latvia. The Presburger Award 2013 was sponsored by CWI, Centrum Wiskunde & Informatica (cwi.nl/)Why it's here
1 person recommends thisWhat people say. Recommended as an engaging talk on the complexity theory and NP-hardness of popular games and puzzles.