Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 1981, Volume 17, Issue 4, Pages 119–123 (Mi ppi1425)  
Сorrespondence

On Some Properties of $Q$-Complexity of Finite Objects

E. Z. Dyment
Full-text PDF (789 kB)
Abstract: We introduce and examine the notion of a $Q$-complexity of a word $x$ (complexity of finding a word to which $x$ is related with respect to relation $Q$).
Received: 05.10.1978
Revised: 18.03.1981
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.2
Language: Russian
Citation: E. Z. Dyment, “On Some Properties of $Q$-Complexity of Finite Objects”, Probl. Peredachi Inf., 17:4 (1981), 119–123
Citation in format AMSBIB
\Bibitem{Dym81}
\by E.~Z.~Dyment
\paper On Some Properties of $Q$-Complexity of Finite Objects
\jour Probl. Peredachi Inf.
\yr 1981
\vol 17
\issue 4
\pages 119--123
\mathnet{http://mi.mathnet.ru/ppi1425}
\zmath{https://zbmath.org/?q=an:0495.03023}
Linking options:
  • https://www.mathnet.ru/eng/ppi1425
  • https://www.mathnet.ru/eng/ppi/v17/i4/p119
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:118
    Full-text PDF :50
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024