Citation Relationships

Legends: Link to a Model Reference cited by multiple papers


Uchizawa K, Douglas R, Maass W (2006) On the computational power of threshold circuits with sparse activity. Neural Comput 18:2994-3008 [PubMed]

References and models cited by this paper

References and models that cite this paper

Cheremisin OV (2003) On the activity of cell circuits realising the system of all conjunctions Discrete Math Appl 13:209-219
Groger HD, Turan G (1991) On linear decision trees computing Boolean functions Lecture Notes In Computer Science 510:707-718
Hajnal A, Maass W, Pudlak P, Szegedy M, Turan G (1993) Threshold circuits of bounded depth J Comput System Sci 46:129-154
Kasim-Zade M (1992) On a measure of the activeness of circuits made of functional elements Math Prob Cybernet 4:218-228
Kissin G (1991) Upper and lower bounds on switching energy in VLSI J Assoc Comp Mach 38:222-254
Lennie P (2003) The cost of cortical computation. Curr Biol 13:493-7 [PubMed]
Margrie TW, Brecht M, Sakmann B (2002) In vivo, low-resistance, whole-cell recordings from neurons in the anaesthetized and awake mammalian brain. Pflugers Arch 444:491-8 [Journal] [PubMed]
Minsky M, Papert S (1969) Perceptrons: An Introduction to Computational Geometry
Olshausen BA, Anderson CH, Van Essen DC (1995) A multiscale dynamic routing circuit for forming size- and position-invariant object representations. J Comput Neurosci 2:45-62 [PubMed]
Parberry I (1994) Circuit complexity and neural networks
Reif JH, Tyagi A (1990) Energy complexity of optical computations Proc 2nd IEEE Symposium on Parallel and Distributed Processing :14-21
Roychowdhury VP, Siu KY, Orlitsky A (1994) Theoretical advances in neural computation and learning, Roychowdhury VP:Siu KY:Orlitsky A, ed.
Siu KY, Roychowdhury V, Kailath T (1995) Discrete neural computation; A theoretical foundation
Weinzweig MN (1961) On the power of networks of functional elements Dokl Akad Nauk SSSR 139:320-323
(14 refs)