10/11/2016 - 12:15pm

10/11/2016 - 1:10pm

Speaker:

Daqing Wan (UC Irvine)

Abstract:

The subset sum problem over finite fields is a well known NP-complete problem, with a wide range of applications in coding theory, cryptography and computer science. In this talk, we will review this problem from both complexity and algorithm points of view. Then we propose a new algebraic variant, where many new interesting questions arise and some of them could be studied by methods from combinatorics and number theory.

Where:

Millikan 2099, Pomona College