| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
On Minimal Strings Containing the Elements of S_n by Decimation
Abstract : The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show that sequences of this form are $O(n^2)$ in length, but finding optimal solutions can be difficult.
Cited literature [15 references]
https://hal.inria.fr/hal-01182969
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 11:26:57 AM
Last modification on : Tuesday, December 10, 2019 - 1:44:03 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:46:06 AM
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 11:26:57 AM
Last modification on : Tuesday, December 10, 2019 - 1:44:03 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:46:06 AM
File
dmAA0112.pdf
Publisher files allowed on an open archive