On the subset sum problem over finite fields
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 … 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 …
On the subset sum problem over finite fields
Did you know?
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 … 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 the number of hinges in spectral gr…
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 … 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 …
Web8 de abr. de 2024 · Abstract A new algorithm is proposed for deciding whether a system of linear equations has a binary solution over a field of zero characteristic. The algorithm is … Web29 de jan. de 2003 · This is a finite field analogue of a result of Erdos and Szemeredi. We then use this estimate to prove a Szemeredi-Trotter type theorem in finite fields, and …
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 > …
WebThe subset sum problem over finite fields is a well-known {\\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study … onp bonificacionWeb1 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 … in work conditionalityWebsolution over a field of zero characteristic. The algorithm is efficient under a certain constraint on the system of equations. This is a special case of an integer programming problem. In the extended version of the subset sum problem, the weight can be posi tive or negative. The problem under consideration is in work comp formsWeb25 de mar. de 2024 · 1 Introduction 1.1 Minkowski’s bound for polynomial automorphisms. Finite subgroups of $\textrm {GL}_d (\textbf {C})$ or of $\textrm {GL}_d (\textbf {k})$ for $\textbf {k}$ a number field have been studied extensively. For instance, the Burnside–Schur theorem (see [] and []) says that a torsion subgroup of $\textrm {GL}_d … onp berounWeb14 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 … onp bethuneWeb13 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 … in work comp boardWeb1 de mai. de 2024 · On the subset sum problem over finite fields. Finite Fields Appl., 14 (2008), pp. 911-929. View PDF View article View in Scopus Google Scholar [5] V. … onp beneficios