Lesson 7: Algorithmic Lower Bounds by Mohammad Hajiaghayi: Puzzle Problem NP-Hardness via 3-SAT
In this session we talk about proving puzzle problem NP-Hardness via 3-SAT.
#Partition, #3Partition, #NPCompleteness, #SchedulingChallenges, #EqualSums, #WeakNPCompleteness, #StrongNPCompleteness, #ComplexityTheory, #Integers, #SubsetDivision, #Foundations, #Scheduling, #MathematicalChallenges, #AlgorithmDesign, #ComputationalComplexity, #TheoreticalComputerScience, #AlgorithmicLowerBounds
All handwritten lecture notes for this course are available through the website of the instructor
at http://www.cs.umd.edu/~hajiagha/ALB19... (Just click on the "Algorithmic Lower Bounds: Fun with Hardness Proofs" course from the website).
The BOOK for the course entitled "Computational Intractability: A Guide to Algorithmic Lower Bounds" by Demaine, Gasarch, and Hajiaghayi is freely available at https://hardness.mit.edu/