Searching for "Promise Problems Complete for Complexity Classes" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

A Promise Class at Least as Hard as the Polynomial Hierarchy
by Jorg Rothe — 1994
… problems complete for complexity classes. Information and Computation 78, 1988, 87-98. [SIM75] J. SIMON…
Add To MetaCart

Reductions to Sets of Low Information Content
by V. Arvind — 1992
… Polytechnic Institute, Worcester, MA, March 1990. A. Selman. Promise problems complete for complexity classes…
Cited by 23 (5 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB