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.

Complexity of Promise Problems on Classical and Quantum Automata

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano. Complexity of Promise Problems on Classical and Quantum Automata. In Cristian S. Calude, Rusins Freivalds, Iwama Kazuo, editors, Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. Volume 8808 of Lecture Notes in Computer Science, pages 161-175, Springer, 2014. [doi]

Authors

Maria Paola Bianchi

This author has not been identified. Look up 'Maria Paola Bianchi' in Google

Carlo Mereghetti

This author has not been identified. Look up 'Carlo Mereghetti' in Google

Beatrice Palano

This author has not been identified. Look up 'Beatrice Palano' in Google
runs on