Web1 de fev. de 2024 · We show that there is a deterministic polynomial time algorithm for the m-th moment k-subset sum problem over finite fields for each fixed m when the evaluation set is the image set of a monomial or Dickson polynomial of any degree n. In the classical case m = 1, this recovers previous results of Nguyen-Wang (the case m = 1, p > … Web17 de ago. de 2007 · Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving …
On the Distribution of the Subset Sum Pseudorandom Number …
Web1 de set. de 2024 · The k-subset sum problem (k-SSP for short) over finite fields is to understand the number N D (k, b). It has several applications in coding theory, … Web14 de out. de 2024 · The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is … cd singh
On the subset sum problem for finite fields Request PDF
Web8 de mar. de 2024 · Stack Exchange network consists of 181 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share … WebWe study a finite analog of a conjecture of Erdös on the sum of the squared multiplicities of the distances determined by an -element point set. Our result is based on an estimate of … Web1 de dez. de 2024 · Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving an explicit … cds infection