IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4614-7258-2_24.html
   My bibliography  Save this book chapter

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

In: The Mathematics of Paul Erdős I

Author

Listed:
  • Pavel Pudlák

    (Institute of Mathematics, Academy of Sciences)

  • Jiří Sgall

    (Computer Science Institute of Charles University)

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.

Suggested Citation

  • Pavel Pudlák & Jiří Sgall, 2013. "An Upper Bound for a Communication Game Related to Time-Space Tradeoffs," Springer Books, in: Ronald L. Graham & Jaroslav Nešetřil & Steve Butler (ed.), The Mathematics of Paul Erdős I, edition 2, pages 399-407, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4614-7258-2_24
    DOI: 10.1007/978-1-4614-7258-2_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4614-7258-2_24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.