Publications
Search

Publications :: Search

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2010
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Rahul Jain
    2. Hartmut Klauck
    3. Shengyu Zhang
    Download (by DOI): 10.1007/978-3-642-14031-0_8
    BibTeX: conf/cocoon/JainKZ10
    DBLP: db/conf/cocoon/cocoon2010.html#JainKZ10
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings 2010
    URL: http://dx.doi.org/10.1007/978-3-642-14031-0
    DBLP: db/conf/cocoon/cocoon2010.html