Diskretnyi Analiz i Issledovanie Operatsii
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


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




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

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1998, Volume 5, Issue 2, Pages 78–89 (Mi da355)  
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases

V. A. Orlov

Russian State University for the Humanities
Full-text PDF (1286 kB) Citations (1)
Received: 30.11.1997
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: V. A. Orlov, “On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 78–89
Citation in format AMSBIB
\Bibitem{Orl98}
\by V.~A.~Orlov
\paper On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1998
\vol 5
\issue 2
\pages 78--89
\mathnet{http://mi.mathnet.ru/da355}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1673379}
\zmath{https://zbmath.org/?q=an:0902.94033}
Linking options:
  • https://www.mathnet.ru/eng/da355
  • https://www.mathnet.ru/eng/da/v5/s1/i2/p78
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025