Sign inSign in

Anil Adad is a Professor at Carnegie Mellon University working in algorithms and theoretical computer science.

More

Anil Adad is a Professor at Carnegie Mellon University working in algorithms and theoretical computer science. His undergraduate lecture for CMU 15-455 builds the polynomial hierarchy from co-NP, E-CLIQUE and SMALLEST-CIRCUIT, defines Σi\Sigma_i and Πi\Pi_i, and proves that P = NP collapses PH to P.

About

Anil Adad is a Professor at Carnegie Mellon University working in algorithms and theoretical computer science. His undergraduate lecture for CMU 15-455 builds the polynomial hierarchy from co-NP, E-CLIQUE and SMALLEST-CIRCUIT, defines Σi\Sigma_i and Πi\Pi_i, and proves that P = NP collapses PH to P.

Connections

4

Their places, courses, books and lectures.