A polynomial-time algorithm for finding zero-sums. (Q1043611)
From MaRDI portal
 | 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: A polynomial-time algorithm for finding zero-sums. |
scientific article; zbMATH DE number 5644054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for finding zero-sums. |
scientific article; zbMATH DE number 5644054 |
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
0.8535715
0 references
0.85310316
0 references
0.85243744
0 references
0.85155815
0 references
0.8497024
0 references
0 references
0.84867233
0 references
