A quadratic lower bound for topswops (Q410720): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An \((18/11)n\) upper bound for sorting by prefix reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the problem of sorting burnt pancakes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Placement and Shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diameter of the Pancake Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank

Latest revision as of 01:46, 5 July 2024

scientific article
Language Label Description Also known as
English
A quadratic lower bound for topswops
scientific article

    Statements

    A quadratic lower bound for topswops (English)
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    0 references
    topswops
    0 references
    reverse card shuffle
    0 references
    pancake problem
    0 references
    prefix reversals
    0 references
    lower bounds
    0 references
    permutations
    0 references
    conway card games
    0 references
    0 references
    0 references