Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
12. Intractability: Checking Algorithms
The chapter delves into the concept of intractability in algorithms, emphasizing the distinction between generating and checking solutions. It highlights important problems such as Boolean satisfiability and the traveling salesman problem, noting that while finding efficient solutions may be difficult or impossible, checking their validity often is not. The chapter concludes by illustrating the relationship between various computational problems and their checking algorithms.
Sections
This section discusses the concepts of intractability and the differences between generating solutions and checking solutions in algorithms.
Not all problems have known efficient algorithms for their solutions.
Checking algorithms can often verify solutions without needing to generate them.
Problems can be transformed based on bounds to facilitate checking algorithms.
Intractability
The property of a problem indicating that no efficient algorithm exists for its solution.
Checking Algorithm
An algorithm that verifies if a given solution to a problem is correct.
Boolean Satisfiability
The problem of determining if a Boolean formula can be satisfied by assigning truth values to its variables.
Traveling Salesman Problem
A problem that seeks the shortest possible route that visits each city exactly once and returns to the origin city.
Independent Set
A set of vertices in a graph, no two of which are adjacent or connected by an edge.
Vertex Cover
A set of vertices that includes at least one endpoint of every edge in the graph.
Practice Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
1 more question available
Enrol free