Counting subset sums of finite Abelian groups (Q645970)
From MaRDI portal
(Redirected from Item:Q1991654)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting subset sums of finite Abelian groups |
scientific article; zbMATH DE number 6968574
- Counting polynomial subset sums
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting subset sums of finite Abelian groups |
scientific article; zbMATH DE number 6968574 |
|
Statements
Counting subset sums of finite Abelian groups (English)
0 references
Counting polynomial subset sums (English)
0 references
11 November 2011
0 references
30 October 2018
0 references
subset sums
0 references
sieve
0 references
finite Abelian groups
0 references
Ramanujan's trigonometric sum
0 references
polynomial subset sums
0 references
inclusion-exclusion
0 references
character sums
0 references
subset sum problem
0 references
counting problems
0 references
0 references
0 references
0.8029062747955322
0 references
0.7844908237457275
0 references
0.7765673398971558
0 references
0.7746881246566772
0 references
0.7738653421401978
0 references
