External Links

Cite Key

Statistics

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

PDF

Tags

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.

A Quantum Lower Bound for the Query Complexity of Simon s Problem

Pascal Koiran, Vincent Nesme, Natacha Portier. A Quantum Lower Bound for the Query Complexity of Simon s Problem. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 1287-1298, Springer, 2005. [doi]

Authors

Pascal Koiran

This author has not been identified. Look up 'Pascal Koiran' in Google

Vincent Nesme

This author has not been identified. Look up 'Vincent Nesme' in Google

Natacha Portier

This author has not been identified. Look up 'Natacha Portier' in Google
runs on