On the lower estimate for <i>k </i>+ 1-nondecomposible permutations
A permutation т is сallеd k + 1-nondecomposible if the following condition holds: if {ai,..., ain} is a set of natural numbers such that 1
Main Author: | G. R. Chelnokov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2007-12-01
|
Series: | Modelirovanie i Analiz Informacionnyh Sistem |
Online Access: | https://www.mais-journal.ru/jour/article/view/1147 |
Similar Items
-
Matrix estimation with latent permutations
by: Mao, Cheng, Ph. D. Massachusetts Institute of Technology
Published: (2018) -
Upper and lower bounds on permutation codes of distance four
by: Sawchuck, Natalie
Published: (2008) -
Quantum Lower Bound for Inverting a Permutation with Advice
by: Nayebi, Aran, et al.
Published: (2015) -
The maximal length of a k-separator permutation
by: Gunby, Benjamin P.
Published: (2014) -
Approximation Algorithms for Sorting <i>λ</i>-Permutations by <i>λ</i>-Operations
by: Guilherme Henrique Santos Miranda, et al.
Published: (2021-06-01)