RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






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


Mathematical Problems of Cybernetics, 2019, Issue 19, Pages 113–122 (Mi mpc1)  

On the lower bound for complexity of implementation of system of elementary symmetric Boolean functions by contact circuits

E. G. Krasulina

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow

Received: 01.04.2005
Revised: 11.02.2015

Linking options:
  • http://mi.mathnet.ru/eng/mpc1

    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
  • Number of views:
    This page:2

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