A polynomial-time algorithm for finding zero-sums. (Q1043611): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:57, 30 January 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
