Summary

Keywords

edge-unfolding polyhedra snake cube puzzle disk packing Clickomania Tetris ruler folding simple map folding

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 In this lecture, Professor Demaine continues deriving strong NP-hardness reductions from 3-partition, and weak NP-hardness reductions from 2-partition. 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

How Companies Win with Coursera

Unlock Global Transformation: Empower Your Team with Cutting-Edge Learning and Digital Upskilling for Future Success with Coursera!

⭐ 5.0

7 ratings

7 min

GTC March 2025 Keynote with NVIDIA CEO Jensen Huang

Unlock the Future: Dive into Cutting-Edge AI Innovations with NVIDIA CEO at GTC 2025!

⭐ 4.0

6 ratings

2 hours

MIT 6.858 Computer Systems Security, Fall 2014

Master Cybersecurity: From Threats to Defenses - Unlock Knowledge with MIT OpenCourseWare's Comprehensive Series!

⭐ 5.0

5 ratings

29.5 hours

Convolutional Neural Networks (Course 4 of the Deep Learning Specialization)

Unlock the World of Computer Vision: Master Edge Detection, Convolutional Networks, and Advanced Object Recognition in this Transformative Course! Dive into the Heart of AI Innovation with Hands-On Learning and Cutting-Edge Techniques!

⭐ 5.0

3 ratings

6 hours

Welcome

MIT 6.890 Algorithmic Lower Bounds, Fall 2014 - 3. 3-Partition II

What you'll learn

This course includes

Summary

Keywords

Full Transcript

Continue this lesson in the app

Related Courses

How Companies Win with Coursera

GTC March 2025 Keynote with NVIDIA CEO Jensen Huang

MIT 6.858 Computer Systems Security, Fall 2014

Convolutional Neural Networks (Course 4 of the Deep Learning Specialization)

FAQs