Analysis of Algorithms - Computer Science & Engineering

About this presentation

P is the set of all tractable problems. A problem or algorithm that has more than polynomial complexity is considered intractable (or infeasible). Note. n1, ...