Pancake flipping is hard (Q494050): Difference between revisions

From MaRDI portal
Merged Item from Q2912724
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancake flipping is hard / rank
 
Normal rank
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 average and highest number of flips in pancake sorting / 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / 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: Polynomial-time sortable stacks of burnt pancakes / rank
 
Normal rank

Latest revision as of 16:30, 10 July 2024

scientific article; zbMATH DE number 6086226
  • Pancake Flipping Is Hard
Language Label Description Also known as
English
Pancake flipping is hard
scientific article; zbMATH DE number 6086226
  • Pancake Flipping Is Hard

Statements

Pancake flipping is hard (English)
0 references
Pancake Flipping Is Hard (English)
0 references
0 references
0 references
0 references
31 August 2015
0 references
25 September 2012
0 references
pancake problem
0 references
permutations
0 references
prefix reversals
0 references
computational complexity
0 references

Identifiers

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