Linear and sublinear time algorithms for the basis of abelian groups (Q553345): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016871353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some computational problems in finite abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the structure of a finite abelian group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On isomorphism testing of a class of 2-nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for Abelian group isomorphism and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism, general remarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A space efficient algorithm for group structure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism / rank
 
Normal rank

Latest revision as of 07:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Linear and sublinear time algorithms for the basis of abelian groups
scientific article

    Statements

    Linear and sublinear time algorithms for the basis of abelian groups (English)
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    abelian group
    0 references
    randomization
    0 references
    decomposition
    0 references
    basis of abelian group
    0 references

    Identifiers