Intensive Algorithms

Subject Code (deprecated): 
ECON
Course Number: 
366
Section Number: 
01
Description: 

Mathematically sophisticated treatment of the design and analysis of algorithms and the theory of NP completeness. Algorithmic paradigms including greedy algorithms, divide and conquer, dynamic programming, network flow, approximation algorithms, and randomized algorithms. Problems drawn from the social sciences, Data Science, Computer Science, and engineering. For students with a flair for proofs and problem solving. Either CPSC 365 or CPSC 366 may be taken for credit.

Instructor(s) from Econ Site: 
Yang Cai
Instructor Name from WEN: 
Yang Cai
Meeting Pattern (deprecated): 
TTh 2.30-3.45
Term Code: 
202001
Category from Feed: 
YCQR