Anil Adad
Professor · Carnegie Mellon University
Anil Adad is a Professor at Carnegie Mellon University working in algorithms and theoretical computer science.
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 and , and proves that P = NP collapses PH to P.
Taught with
Same subject, Algorithms & Theoretical CS
Connections
4Their places, courses, books and lectures.
