Searching for "Comparisons of Polynomial-Time Reducibilities" – sorted by Relevance.

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

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

3 documents found, showing 1 through 3.

A Promise Class at Least as Hard as the Polynomial Hierarchy
by Jorg Rothe — 1994
…. LADNER, N. LYNCH, and A. SELMAN, A comparison of polynomial time reducibilities. Theoretical Computer…
Add To MetaCart

Reductions to Sets of Low Information Content
by V. Arvind — 1992
… Computer Science, 26:287-300, 1983. Y. Yesha. On certain polynomial-time truth-table reducibilities…
Cited by 23 (5 self) – Add To MetaCart

A Comparison of Polynomial Time Redicibilities
by R. Ladner, N. Lynch, A. L. Selman — 1975 — Theoretical Computer Science
… (1975) 103-123. North-Holland Publishing Company A COMPARISON OF POLYNOMIAL TIME REDUCIBILITIES R. E…
Add To MetaCart

Showing 1 through 3.

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