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

TR96-041 | 24th July 1996
Oded Goldreich, Avi Wigderson

On the Circuit Complexity of Perfect Hashing

Revisions: 1 , Comments: 2

We consider the size of circuits which perfectly hash
an arbitrary subset $S\!\subset\!\bitset^n$ of cardinality $2^k$
into $\bitset^m$.
We observe that, in general, the size of such circuits is
exponential in $2k-m$,
and provide a matching upper bound.

more >>>

TR96-040 | 21st May 1996
Thomas Thierauf

The Isomorphismproblem for One-Time-Only Branching Programs

Revisions: 1 , Comments: 1

We investigate the computational complexity of the
isomorphism problem for one-time-only branching programs (BP1-Iso):
on input of two one-time-only branching programs B and B',
decide whether there exists a permutation of the variables of B'
such that it becomes equivalent to B.

Our main result is a two-round interactive ... more >>>


TR96-039 | 27th June 1996
Carme Alvarez, Raymond Greenlaw

A Compendium of Problems Complete for Symmetric Logarithmic Space

Comments: 2

We provide a compendium of problems that are complete for
symmetric logarithmic space (SL). Complete problems are one method
of studying this class for which programming is nonintuitive. A
number of the problems in the list were not previously known to be
complete. A ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint