COURSE DESCRIPTION
Algebra plays an important role in both finding algorithms and understanding the limitations of computation. This course will focus on some of the fundamental algebraic concepts that arise in computation and the algebraic algorithms that have applications in the real life. The course will cover the problems of fast integer (or polynomial) multiplication (or factoring), fast matrix multiplication, primality testing, computing discrete logarithm, polynomial identity testing, etc. The course intends to introduce both basic concepts and practical applications.Prerequisites: Theory of Computation, Algebra.
Text Book: Victor Shoup, A Computational Introduction to Number Theory and Algebra (http://shoup.net/ntb/).
RECENT UPDATE
[14-Nov-14] Take-home endsem from 14-Nov-2014 to 23-Nov (11am).
[03-Nov-14] Saturday, 08-Nov-2014 has Thursday schedule.
[26-Oct-14] Assignment 3 due on 10-Nov-2014.
[16-Oct-14] Extra class on 17-Oct-2014 (2-3:30pm@CS101).
[25-Sep-14] Extra class on 27-Sep-2014 (12-1:15pm@CS101).
[10-Sep-14] Assignment 2 due on 25-Sep-2014.
[09-Aug-14] Assignment 1 due on 20-Aug-2014.
[14-Jun-14] Course begins on Mon, 28-Jul-14.