Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 1987, Issue 1, Pages 135–150 (Mi at4364)  
Automata

Estimation of the program implementation complexity with various forms of boolean functions

L. Ya. Lapkin

Leningrad
Full-text PDF (2290 kB)
Abstract: The complexity of program impementation is discussed for various forms of Boolean functions and implementation methods such as binary, $k$-nary, and matrix-decision programs.

Received: 14.06.1985
Document Type: Article
UDC: 681.306:512.932
Language: Russian
Citation: L. Ya. Lapkin, “Estimation of the program implementation complexity with various forms of boolean functions”, Avtomat. i Telemekh., 1987, no. 1, 135–150
Citation in format AMSBIB
\Bibitem{Lap87}
\by L.~Ya.~Lapkin
\paper Estimation of the program implementation complexity with various forms of boolean functions
\jour Avtomat. i Telemekh.
\yr 1987
\issue 1
\pages 135--150
\mathnet{http://mi.mathnet.ru/at4364}
Linking options:
  • https://www.mathnet.ru/eng/at4364
  • https://www.mathnet.ru/eng/at/y1987/i1/p135
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:116
    Full-text PDF :51
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024