Given a class of combinatorial structures A, a fixed
size n and considering a total order previously defined,
the unrank function gives us the i-th object of
A of size n. We are going to study the average cost of
unrank function when we use the lexicographic or boustrophedonic
product. We will prove that the boustrophedonic product is
theoretically and experimentally better in average cost than
the lexicographic product.
CitationMolinero, X. "El Producte lexicogràfic i el producte boustrofedònic". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org