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.

Hard Promise Problems and Nonuniform Complexity

Luc Longpré, Alan L. Selman. Hard Promise Problems and Nonuniform Complexity. In Christian Choffrut, Thomas Lengauer, editors, STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings. Volume 415 of Lecture Notes in Computer Science, pages 216-226, Springer, 1990.

Abstract

Abstract is missing.

runs on