Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-010 | 16th February 1995 00:00

An Upper Bound for a Communication Game Related to Time-Space Tradeoffs

RSS-Feed




TR95-010
Authors: Pavel Pudlak, Jiri Sgall
Publication: 16th February 1995 17:15
Downloads: 1109
Keywords: 


Abstract:


We prove an unexpected upper bound on a communication game proposed
by Jeff Edmonds and Russell Impagliazzo as an approach for
proving lower bounds for time-space tradeoffs for branching programs.
Our result is based on a generalization of a construction of Erdos,
Frankl and Rodl of a large 3-hypergraph with no 3
distinct edges whose union has at most 6 vertices.



ISSN 1433-8092 | Imprint