Theory of Computing Systems
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 of Computing Systems, 2019, Volume 63, Issue 5, Pages 956–986
DOI: https://doi.org/10.1007/s00224-018-9900-3 (Mi tcs2) 		 
This article is cited in 1 scientific paper (total in 1 paper)

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
Full-text PDF Citations (1)
DOI: https://doi.org/10.1007/s00224-018-9900-3
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'.
Bibliographic databases:
Document Type: Article
Language: English
Linking options:
  • https://www.mathnet.ru/eng/tcs2
    • 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