O'Reilly logo

Design and Analysis of Algorithms by Himanshu B. Dave, Parag H. Dave

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 17

Tractable and Non-tractable Problems

Objectives

After reading this chapter, you should understand:

  • The need for problem classification: Tractable and Intractable
  • Upper and Lower Bounds
  • Algorithmic Gap: Why the Lower Bound of a Problem and the Best Case of an Algorithm are Different
  • The Class NP-Complete: Why it is a closed set
  • Problem Transformation: One NP-complete problem to another
  • NP-Completeness: How is it proved and Problem Reduction
  • Non-Deterministic Algorithms
  • The most famous open problem in Computer Science : P = NP ?
  • Cook’s Theorem: First known proof of NPCompleteness
  • Approximate Solutions — What it is about
  • The complexity Classes and the meaning of Intractability
  • Undecidable and Non-Computable problems
  • The Halting Problem ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required