On the subset sum problem over finite fields
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 > … WebMoreover, linear tensor-product space-time finite elements can be related to a spatial discretization with finite elements and a temporal discretization with the Crank–Nicolson scheme. 8 Studies of this resulting method often focus either on parabolic problems (heat equation) 24 or on the pure advection case (transport equation). 25 Moreover, a …
On the subset sum problem over finite fields
Did you know?
Web1 de fev. 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 … WebThere are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given …
Web31 de dez. de 2010 · The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally from decoding generalized Reed–Solomon codes. … Web1 de fev. 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 …
WebGiven a prime , an elliptic curve over the finite field of elements and a binary linear recurrence sequence of order , we study the distribution of the sequence of points Web1 de set. de 2024 · We study the k-subset sum problem over finite fields of characteristic 2. We obtain some sufficient conditions for the solvability of the k -subset sum problem over …
Web14 de mar. de 2024 · It is natural to guess that the phenomenon described in Theorem 1.1 is in fact universal in the sense that the theorem holds true for a wide class of coefficients distribution, and not just for Gaussians. In this regard, it is natural (and also suggested in []) to conjecture that Theorem 1.1 holds for random Littlewood polynomials, that is, when …
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 … dynamics of vehicles on roads and tracksWebThe subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the … cry wolf dänische serieWeb1 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, … crywolf delawareWeb1 de out. de 2024 · We improve upon the sum-product problem over Finite Fields of prime order, in a similar spirit to my paper "On higher energy … cry wolf danish series endingWebWe 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 the number of hinges in spectral gr… dynamics of two link robot manipulatorWeb13 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 … cry wolf darstellerWeb1 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 … cry wolf danish review