PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 66: Advanced Combinatorial and Search Algorithms
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
  2. 66.02Branch and bound
  3. 66.03Exact cover
  4. 66.04Binary decision diagrams
    1. Decision graph basics
    2. Reduced ordered BDD
    3. State compression overview
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
  2. 66.02Branch and bound
  3. 66.03Exact cover
  4. 66.04Binary decision diagrams
    1. Decision graph basics
    2. Reduced ordered BDD
    3. State compression overview
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
Home/DSA/Advanced Combinatorial and Search Algorithms/Binary decision diagrams
66.04Advanced / Expert3 topics

Binary decision diagrams

Part of Chapter 66: Advanced Combinatorial and Search Algorithms.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

66.04.1

Decision graph basics

Explanation coming soon.

66.04.2

Reduced ordered BDD

Explanation coming soon.

66.04.3

State compression overview

Explanation coming soon.

← Previous · 66.03

Exact cover

Next · 66.05 →

Game theory algorithms

On this page

  • Decision graph basics
  • Reduced ordered BDD
  • State compression overview