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

TR94-019 | 12th December 1994

Lower Bounds for the Computational Power of Networks of Spiking

We investigate the computational power of a formal model for networks of
spiking neurons. It is shown that simple operations on phase-differences
between spike-trains provide a very powerful computational tool that can
in principle be used to carry out highly complex computations on a small
network of spiking neurons. We ... more >>>


TR94-022 | 12th December 1994
Christoph Meinel, Stephan Waack

The Möbius Function, Variations Ranks, and Theta(n)--Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem

We prove that the modular communication complexity of the
undirected graph connectivity problem UCONN equals Theta(n),
in contrast to the well-known Theta(n*log n) bound in the
deterministic case, and to the Omega(n*loglog n) lower bound
in the nondeterministic case, recently proved by ... more >>>


TR94-009 | 12th December 1994
Noga Alon, Raphael Yuster, Uri Zwick

Color-coding


We describe a novel randomized method, the method of
{\em color-coding\/} for finding simple paths and cycles of a specified
length $k$, and other small subgraphs, within a given graph $G=(V,E)$.
The randomized algorithms obtained using this method can be
derandomized using families of {\em perfect hash functions\/}. ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint