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


Inform. Process. Lett., 2012, Volume 112, Issue 7, Pages 267–271 (Mi ipl1)  

Exponential lower bound for bounded depth circuits with few threshold gates

V. V. Podolskii

Steklov Mathematical Institute, Gubkina str. 8, 119991, Moscow, Russia

Abstract: We prove an exponential lower bound on the size of bounded depth circuits with $O(\log n)$ threshold gates computing an explicit function (namely, the parity function).
Previously exponential lower bounds were known only for circuits with one threshold gate. Superpolynomial lower bounds are known for circuits with $O(\log n)$ threshold gates.

DOI: https://doi.org/10.1016/j.ipl.2011.12.011


Bibliographic databases:

Received: 26.05.2011
Revised: 07.12.2011
Accepted:09.12.2011
Language:

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

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

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