Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR06-138 | 13th November 2006
Kei Uchizawa, Rodney Douglas

Energy Complexity and Entropy of Threshold Circuits

Circuits composed of threshold gates (McCulloch-Pitts neurons, or
perceptrons) are simplified models of neural circuits with the
advantage that they are theoretically more tractable than their
biological counterparts. However, when such threshold circuits are
designed to perform a specific computational task they usually
differ ... more >>>


TR06-137 | 13th November 2006
Prashant Joshi, Eduardo D. Sontag

Computational aspects of feedback in neural circuits

It had previously been shown that generic cortical microcircuit
models can perform complex real-time computations on continuous
input streams, provided that these computations can be carried out
with a rapidly fading memory. We investigate in this article the
computational capability of such circuits in the ... more >>>


TR06-136 | 22nd October 2006
Mihir Bellare, Oded Goldreich

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge

This note points out a gap between two natural formulations of
the concept of a proof of knowledge, and shows that in all
natural cases (e.g., NP-statements) this gap can be closed.
The aforementioned formulations differ by whether they refer to
(all possible) probabilistic or deterministic prover strategies.
Unlike ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint