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

Pavel Pudlák () and Jiří Sgall
Additional contact information
Pavel Pudlák: Institute of Mathematics, Academy of Sciences
Jiří Sgall: Computer Science Institute of Charles University

A chapter in The Mathematics of Paul Erdős I, 2013, pp 399-407 from Springer

Abstract: Summary. We prove an unexpected upper bound on a communication game proposed by Jeff Edmonds and Russell Impagliazzo [2, 3] 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 Erdős, Frankl and Rödl [5] of a large 3-hypergraph with no 3 distinct edges whose union has at most 6 vertices.

Keywords: Communication Game; Time-space Tradeoff; Branching Programs; Hypergraph; Russell Impagliazzo (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_24

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().