Skip to main content
SpringerLink
Log in

Depth-2 Threshold Circuits

Provable Limitations

  • General Article
  • Published:
Resonance Aims and scope Submit manuscript

Abstract

Circuits with linear threshold functions as primitives are a natural model for computation in the brain. Small threshold circuits of depth two cannot compute most functions, but how do we prove such a statement? And how do we lay our hands on explicit functions that they cannot compute? This article gives an overview of the landscape.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Suggested Reading

  1. Eyal Kushilevitz and Noam Nisan, Communication Complexity, Cambridge University Press, 1997.

    Google Scholar 

  2. Mikael Goldmann, Johan Håastad and Alexander A Razborov, Majority Gates vs. General Weighted Threshold Gates, Computational Complexity, Vol.2, pp.277–300, 1992.

    Article  Google Scholar 

  3. Thomas Hofmeister, A Note on the Simulation of Exponential Threshold Weights, Computing and Combinatorics, Second Annual International Conference, COCOON’ 96, Hong Kong, June 17–19, 1996, Proceedings, pp.136–141, 1996.

    Google Scholar 

  4. András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, and György Turán, Threshold Circuits of Bounded Depth, Journal of Computer and System Sciences, Vol.46, No.2, pp.129–154, 1993.

    Article  Google Scholar 

  5. Harry Buhrman, Nikolay Vereshchagin, and Ronald de Wolf, On Computation and Communication with Small Bias, Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC’ 07, pp.24–32. IEEE Computer Society, 2007.

    Google Scholar 

  6. Jürgen Forster, Matthias Krause, Satyanarayana V Lokam, Rustam Mubarakzjanov, Niels Schmitt and Hans Ulrich Simon, Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13–15, 2001, Proceedings, pp.171–182, 2001.

    Google Scholar 

  7. Arkadev Chattopadhyay and Nikhil S Mande, A Short List of Equalities Induces Large Sign Rank, Proc. 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2018. Preliminary version in ECCC TR 2017-083.

    Google Scholar 

  8. Jürgen Forster, A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity, Journal of Computer and System Sciences, Vol.65, No.4, pp.612–625, 2002.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Sciences (HBNI) CIT Campus, Chennai, 600113, India

    Meena Mahajan

Authors
  1. Meena Mahajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meena Mahajan.

Additional information

Meena Mahajan works in the theoretical computer science group at the Institute of Mathematical Sciences (IMSc, HBNI) in Chennai. Her research is in the area of computational complexity. She is particularly interested in questions concerning circuit complexity — how much circuitry is needed to compute a function, and in proof systems — how hard is it to prove that a false statement is indeed false.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mahajan, M. Depth-2 Threshold Circuits. Reson 24, 371–380 (2019). https://doi.org/10.1007/s12045-019-0786-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12045-019-0786-4

Keywords

Search

Navigation