中科院数学与系统科学研究院

数学研究所

学术报告会

报告人:  Prof. Daqing Wan (University of California, Irvine, USA)

题  目：Algebraic subset sums over finite fields

时  间：2016.08.26（星期五），10:00-11:00

地  点：数学院南楼902室

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 the known complexity results and algorithms for this problem, and then propose a new algebraic variant, where it is plausible to hope for a polynomial time algorithm.