Theory of Computation (CS3102), Lecture 25, Professor Gabriel Robins, Spring 2018 Panopto @GabrielRobins
Theory of Computation (CS3102), Lecture 25, Professor Gabriel Robins, Spring 2018 Panopto  @GabrielRobins
Uploaded April 2018 | Updated November 2026, 2 days ago
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS3102 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs3102 and other related videos at http://www.cs.virginia.edu/~robins/videos.html

Specific topics covered in this lecture: bounded-degree graph colorability, NP-completeness of max-degree-4 graph colorability, degree-reduction "gadgets", 3-colorability constraint-propagation, local replacement of nodes by super-gadgets, threshold of intractability, 2-colorability, odd
cycles, infinite graphs, chromatic numbers, membership-preserving transformations, planar graphs, Kuratowski's theorem, planarity-preserving gadgets, NP-completeness of 3-coloring planar graphs, composing reductions, 3-colorability of planar max-degree-4 graphs is NP-complete, searching for smaller / simpler gadgets, Four-Color Theorem, graph-colorability on tori
Theory of Computation (CS3102), Lecture 25, Professor Gabriel Robins, Spring 2018 PanoptoAlgorithms Lecture 01, August 27, 2019 - Panopto versionBerenika and Barry dancingLaura and Gabe dancing Cha Cha - Get the Party Started (Pink)Sophie and Adam dancing at the USA Dance Showcase, June 2026Theory of Computation (CS3102), Lecture 15, Professor Gabriel Robins, Spring 2018 PanoptoTheory of Computation (CS6160) Lecture 10 (Part 1 of 2), Professor Gabriel RobinsBerenika and Alp dancingLine dance at Eds house (Oct 31, 2026)Gabe and Meghan dancing - Livin La Vida LocaTims spectacular Birthday dance at Bachata Flow, May 2026Algorithms Lecture 03, Sept 3, 2019 - Panopto version
Gabriel Robins |

Theory of Computation (CS3102), Lecture 25, Professor Gabriel Robins, Spring 2018 Panopto

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER