Meeting 4.1: ComplexityI continue to review some of the usual suspects in complexity: P, NP, PSPACE, EXP and such. I then introduce two basic notions of reduction: polynomial-time many-one reductions (aka Karp reductions)…
From Eric Samperton
| 22
22 plays
| 0
|