Analysis of Digital Expansions of Minimal Weight
Extending an idea of Suppakitpaisarn, Edahiro and Imai, a dynamic programming approach for computing digital expansions of minimal weight is transformed into an asymptotic analysis of minimal weight expansions. The minimal weight of an optimal expansion of a random input of length $\ell$ is shown to...
Main Authors: | Florian Heigl, Clemens Heuberger |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3009/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01) -
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01) -
Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01) -
Stokes polyhedra for $X$-shaped polyminos
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)