An asymptotic formula for counting subset sums over subgroups of finite fields (Q661990): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1101.0289 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the List and Bounded Distance Decodability of Reed–Solomon Codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999066 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the subset sum problem over finite fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new sieve for distinct coordinate counting / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4344108 / rank | |||
Normal rank | |||
Latest revision as of 22:31, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic formula for counting subset sums over subgroups of finite fields |
scientific article |
Statements
An asymptotic formula for counting subset sums over subgroups of finite fields (English)
0 references
11 February 2012
0 references
distinct coordinate sieve
0 references
subset sum problem
0 references
finite fields
0 references
character sum
0 references
inclusive
0 references
exclusive principle
0 references
