We may earn an affiliate commission when you visit our partners.

Intractability

Save

May 1, 2024 3 minute read

Intractability is a fascinating area of computer science that delves into the inherent difficulty of solving certain computational problems. It explores the limitations of what computers can accomplish, even with unlimited time and resources.

Background and Significance

Path to Intractability

Take the first step.

We've curated three courses to help you on your path to Intractability. Use these to develop your skills, build background knowledge, and put what you learn to practice.

Sorted from most relevant to least relevant:

Algorithms, Part II

Save

Dynamic Programming, Greedy Algorithms

Save

Computer Science: Algorithms, Theory, and Machines

Save

Help others find this page about Intractability: by sharing it with your friends and followers:

Facebook

Copy Link

Reading list

We've selected six books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in Intractability.

Introduction to the Theory of Computation

Save

Provides a broad overview of computational complexity theory, from basic concepts to advanced topics, and is suitable for both undergraduate and graduate students.

Introduction to the Theory of Computation

Paperback

Check price

Introduction to the Theory of Computation

Kindle Edition

Check price