A polynomial-time algorithm for finding zero-sums. (Q1043611): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2008.06.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2008.06.018 / rank | |||
Normal rank | |||
Latest revision as of 15:00, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for finding zero-sums. |
scientific article |
Statements
A polynomial-time algorithm for finding zero-sums. (English)
0 references
9 December 2009
0 references
finite Abelian groups
0 references
Erdős-Ginzburg-Ziv theorem
0 references
polynomial-time algorithms
0 references
zero-sum sequences
0 references
