Publications
Search

Publications :: Search

Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?

Show publication

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

    Publication properties
    Title: Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2004
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Xiaoming Sun
    2. Andrew Chi-Chih Yao
    3. Shengyu Zhang
    Download (by DOI): comp/proceedings
    BibTeX: conf/coco/SunYZ04
    DBLP: db/conf/coco/coco2004.html#SunYZ04
    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: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004
    DBLP: db/conf/coco/coco2004.html