POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS (Q5297787): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218196707003597 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050463519 / rank
 
Normal rank

Latest revision as of 10:10, 30 July 2024

scientific article; zbMATH DE number 5170908
Language Label Description Also known as
English
POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS
scientific article; zbMATH DE number 5170908

    Statements

    POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS (English)
    0 references
    0 references
    13 July 2007
    0 references
    free groups
    0 references
    endomorphism problem
    0 references
    computational complexity
    0 references
    efficient algorithms
    0 references
    polynomial time algorithms
    0 references

    Identifiers

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