Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Harumichi
    Last name: Nishimura
    DBLP: 02/5630
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 75  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura.
    Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems.
    Quantum Information Computation 2012, Volume 12 (0) 2012
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
    Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    CoRR 2004, Volume 0 (0) 2004
    Conference paper
    Tomoyuki Yamakami, Harumichi Nishimura.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An application of quantum finite automata to interactive proof systems.
    J. Comput. Syst. Sci. 2009, Volume 75 (0) 2009
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems.
    Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers 2004 (0) 2004
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita.
    Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Harumichi Nishimura, Masanao Ozawa.
    Computational complexity of uniform quantum circuit families and quantum Turing machines.
    Theor. Comput. Sci. 2002, Volume 276 (0) 2002
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
    J. Cryptology 2012, Volume 25 (0) 2012
    Show item 1 to 75 of 75  

    Your query returned 75 matches in the database.