A Managerial Perspective of P vs NP Problem

Abstract

This case introduces the deepest unanswered question in computer science, a problem called P vs. NP. Using an analogy of sudoku, we try to understand the core ask of this problem and where the main dilemma lies. We then explore few technical jargons specific to understand this question and finally revisit the problem by exploring a fresh perspective of a decision-maker. The case postulates a managerial analogy to appreciate the complexity of the problem and encourage its implications in interdisciplinary scenarios like decision-execution conundrum.