CM 434 Techniques in Computational Number TheoryComputational Mathematics (2009-2010)
An introduction to: integer factorization, elliptic curves methods, primality testing, fast integer arithmetic, fast Fourier transforms and quantum computing. This course is taught with a philosophy that encourages experimentation. [Offered: F]
Prerequisites: One of CM 339/CS 341, PMATH 334, 336, 345, 346; Not open to General Mathematics students
Notes: (Cross-listed with PMATH 434)
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Hare, Kevin George | 12:30-01:20 M T W Th F | 0/15 | 1 | 1 | MC 4064 | 7174 | ||
| Held With: PMATH 434 | ||||||||
Sections For Spring 2009
CM 434 is not held in Spring 2009