Econ 366b. Intensive Algorithms

Time: 
12:43pm
Day / time: 
T/Th 2:30 - 3:45 pm
Course Type: 
Undergraduate
Course term: 
Spring
Instructor(s): 

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.

: MATH 244 and CPSC 223.

[also CPSC366]

Semester offered: 
Spring
Undergrad Course Category: 
Macroeconomics
Methodology
Course Description: 
Course Description