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.
Luc Longpré, Alan L. Selman. Hard Promise Problems and Nonuniform Complexity. Theoretical Computer Science, 115(2):277-290, 1993.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Hard Promise Problems and Nonuniform ComplexityLuc Longpré, Alan L. Selman. STACS 1990: 216-226 The Complexity of Promise ProblemsAlan L. Selman, Yacov Yacobi. icalp 1982: 502-509
The following publications are possibly variants of this publication: