Counting points on hypersurfaces

02/09/2010 - 12:15pm
02/09/2010 - 1:10pm
Daqing Wan (UC Irvine)

Point counting over a finite field is a central topic in algorithmic number theory. It has attracted a great deals of attention in recent years due to its diverse applications in areas such as cryptography, coding theory, and computer science. In this lecture, we shall give a self-contained expository introduction to counting the number of rational points on a hypersurface defined over a finite field, covering both algorithmic and complexity aspects.

Millikan 208 (Pomona College)

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences