Theory of Computation (CS3102), Lecture 23, Professor Gabriel Robins, Spring 2018 @GabrielRobins
Theory of Computation (CS3102), Lecture 23, Professor Gabriel Robins, Spring 2018  @GabrielRobins
Uploaded April 2018 | Updated November 2026, 5 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: NP-completeness reloaded, satisfiability, 1-SAT, 2-SAT, 3-SAT, cliques, covers, Hamiltonian cycles, graph coloring, partitioning, knapsacks, bin packing, Steiner trees, traveling salesman, moving-target TSP, TSP heuristics, 2-OPT, triangle inequality, graph colorability, Karp's seminal paper, reductions scheme, origin of NP-completeness
Theory of Computation (CS3102), Lecture 23, Professor Gabriel Robins, Spring 2018Anna and Cristian dancing Tango (Milonga), May 2025Gabe and Alex dancing - I Love Rock and RollTheory of Computation (CS3102), Lecture 13, Professor Gabriel Robins, Spring 2018 (Panopto)Theory of Computation (CS3102), Lecture 28, Professor Gabriel Robins, Spring 2018 Panopto HiResAlgorithms Lecture 24, Nov 19, 2019Tim and Boris dancing, Sept 2025Tims dance workshop - Salsa basic, Sept 27, 2025Theory of Computation (CS3102), Lecture 10, Professor Gabriel Robins, Spring 2018Algorithms Lecture 05, Sept 10, 2019 - PanoptoAlgorithms Lecture 15, Oct 17, 2019 - Part 1 of 2Tim and Gabe dancing, June 3, 2026
Gabriel Robins |

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

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER