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


Theory Comput. Syst., 2019, Volume 63, Issue 5, Pages 956–986 (Mi tcs2)  

Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates

Alexander S. Kulikova, Vladimir V. Podolskiibc

a Steklov Mathematical Institute at St. Petersburg, Russian Academy of Sciences, St. Petersburg, Russia
b Steklov Mathematical Institute, Russian Academy of Sciences
c National Research University Higher School of Economics, Moscow, Russia

Funding Agency Grant Number
Russian Science Foundation 16-11-10123
Ministry of Education and Science of the Russian Federation MK-5379.2018.1
5-100
A preliminary version of this paper [18] appeared in the proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017). The research presented in Section 4 was supported by Russian Science Foundation (project 16-11-10123). The research presented in Section 5 was partially supported by grant MK-5379.2018.1 and by the Russian Academic Excellence Project '5-100'.


DOI: https://doi.org/10.1007/s00224-018-9900-3


Bibliographic databases:

Language:

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

    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:4

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