نتایج جستجو برای: complexities

تعداد نتایج: 16626  

Journal: :Annals of Pure and Applied Logic 1995

Journal: :The European Physical Journal D 2009

Journal: :Molecular Systems Biology 2007

Journal: :Australian & New Zealand Journal of Psychiatry 2019

Journal: :Canadian Medical Association Journal 2012

Journal: :Discrete and Computational Geometry 2004

Journal: :IACR Cryptology ePrint Archive 2005
Hao Chen Liqing Xu

Klapper [1] showed that there are binary sequences of period q − 1(q is a prime power p, p is an odd prime) with the maximal possible linear complexity q−1 when considered as sequences over GF (2), while the sequences have very low linear complexities when considered as sequences over GF (p). This suggests that the binary sequences with high GF (2) linear complexities and low GF (p) linear comp...

Journal: :CoRR 2012
Laurent Bienvenu Andrej Muchnik Alexander Shen Nikolai K. Vereshchagin

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin [13] saying that limsupnC(x|n) (here C(x|n) is conditional (plain) Kolmogorov complexity of x when n is known) equals C0 ′ (x), the plain Kolmogorov complexity with 0′-oracle. Then we use the same argument to prove similar resu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید