Searching for "Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy." – 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
…. ROTHE and J. VOGEL, A note on the polynomial-time hierarchy and probabilistic operators. Technical…
Add To MetaCart

Applications of Polynomial and Rational Approximation. . .
by Nicolas Frederick Reingold, K. Siu, V. Roychowdhury — 1992
…. Counting classes are at least as hard as the polynomial-time hierarchy. In Proceedings of the 6th Annual…
Add To MetaCart

Showing 1 through 2.

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