A polynomial-time algorithm for finding zero-sums. (Q1043611): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.06.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063123247 / rank | |||
Normal rank | |||
Revision as of 23:15, 19 March 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
