An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/1798596.1798598 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012661148 / rank
 
Normal rank

Latest revision as of 14:34, 19 March 2024

scientific article
Language Label Description Also known as
English
An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set
scientific article

    Statements

    An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (English)
    0 references
    0 references
    0 references
    18 November 2014
    0 references
    universal cycle
    0 references
    loopless algorithm
    0 references

    Identifiers

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