A polynomial-time algorithm for finding zero-sums. (Q1043611): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.06.018 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On three zero‐sum Ramsey‐type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-sum problems -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on a zero-sum theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing permutation matrices from diagonal sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5841589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on finite abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted sums in abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler proof and a generalization of the zero-trees theorem / rank
 
Normal 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references