|
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.
|
