Publications
Search

Publications :: Search

Direct Product Theorems for Communication Complexity via Subdistribution Bounds.

Show publication

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

    Publication properties
    Title: Direct Product Theorems for Communication Complexity via Subdistribution Bounds.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2007
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Rahul Jain
    2. Hartmut Klauck
    3. Ashwin Nayak
    Download (by DOI): eccc-reports/2007
    BibTeX: journals/eccc/JainKN07
    DBLP: db/journals/eccc/eccc14.html#JainKN07
    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.

    Journal
    Name: Electronic Colloquium on Computational Complexity (ECCC)
    Year: 2007
    Volume: 14
    Number: 1
    DBLP: db/journals/eccc/eccc14.html