RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 1996, Volume 3, Number 1, Pages 52–56 (Mi da427)  

This article is cited in 9 scientific papers (total in 9 papers)

A lower bound on complexity for schemes of the concatenation of words

Yu. V. Merekin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (520 kB)

Bibliographic databases:
UDC: 519.714
Received: 05.01.1996

Citation: Yu. V. Merekin, “A lower bound on complexity for schemes of the concatenation of words”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 52–56

Citation in format AMSBIB
\Bibitem{Mer96}
\by Yu.~V.~Merekin
\paper A~lower bound on complexity for schemes of the concatenation of words
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 1
\pages 52--56
\mathnet{http://mi.mathnet.ru/da427}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1444681}
\zmath{https://zbmath.org/?q=an:0945.68527}


Linking options:
  • http://mi.mathnet.ru/eng/da427
  • http://mi.mathnet.ru/eng/da/v3/i1/p52

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Merekin Y.V., “Upper bounds for the complexity of sequences generated by symmetric Boolean functions”, Discrete Appl Math, 114:1–3 (2001), 227–231  crossref  mathscinet  zmath  isi  scopus
    2. Yu. V. Merekin, “Otsenki multiplikativnoi slozhnosti dvoichnykh slov, opredelyaemykh poyaskovymi bulevymi funktsiyami”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 9:2 (2002), 36–47  mathnet  mathscinet  zmath
    3. Yu. V. Merekin, “O porozhdenii slov s ispolzovaniem operatsii kompozitsii”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 10:4 (2003), 70–78  mathnet  mathscinet  zmath
    4. V. N. Potapov, “O maksimalnoi dline dvoichnykh slov s ogranichennoi chastotoi edinits i bez odinakovykh podslov zadannoi dliny”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 11:3 (2004), 48–58  mathnet  mathscinet
    5. Yu. V. Merekin, “Ob additivnoi slozhnosti chastichno kommutativnykh slov”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 12:4 (2005), 40–50  mathnet  mathscinet  zmath
    6. Tszyun Su, “Mnogourovnevyi metod kodirovaniya dannykh v besprovodnykh sensornykh setyakh”, Elektrotekhnicheskie i kompyuternye sistemy, 2011, no. 4, 213–218  elib
    7. Yu. A. Kombarov, “O minimalnykh skhemakh v bazise Sheffera dlya lineinykh bulevykh funktsii”, Diskretn. analiz i issled. oper., 20:4 (2013), 65–87  mathnet  mathscinet
    8. V. V. Kochergin, “On Bellman's and Knuth's problems and their generalizations”, J. Math. Sci., 233:1 (2018), 103–124  mathnet  crossref
    9. V. V. Kochergin, D. V. Kochergin, “Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits”, Moscow University Mathematics Bulletin, 71:2 (2016), 55–60  mathnet  crossref  mathscinet  isi
  • Дискретный анализ и исследование операций
    Number of views:
    This page:271
    Full text:121
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020