Subject: 
Computer Science (CS)
Catalog number: 
765
Unit weight: 
0.50
Meet type: 
LEC
Grading basis: 
NUM
Cross-listing(s): 
CO-785
Requisites: 
N/A
Description: 
Fundamental problems of elementary and algebraic number theory from an algorithmic and computational complexity point of view with emphasis placed on analysis of algorithms. Topics include basic arithmetic algorithms; computation over finite fields; primality testing; algorithms for integer factorization; algorithms in number fields.
Topic titles: 
N/A
Faculty: 
Mathematics (MAT)
Academic level: 
GRD
Course ID: 
011299