Login / Signup

Improved upper bound for sorting permutations by prefix transpositions.

Pramod P. NairRajan SundaravaradhanBhadrachalam Chitturi
Published in: Theor. Comput. Sci. (2021)
Keyphrases
  • branch and bound
  • upper bound
  • lower bound
  • branch and bound algorithm
  • worst case
  • upper and lower bounds
  • sample complexity
  • error probability
  • database
  • three dimensional
  • data structure
  • search engine
  • decision making