External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)

Harumichi Nishimura, Tomoyuki Yamakami. An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). In Jirí Fiala, Václav Koubek, Jan Kratochvíl, editors, Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Volume 3153 of Lecture Notes in Computer Science, pages 827-838, Springer, 2004. [doi]

Authors

Harumichi Nishimura

This author has not been identified. Look up 'Harumichi Nishimura' in Google

Tomoyuki Yamakami

This author has not been identified. Look up 'Tomoyuki Yamakami' in Google
runs on