U. Schoning. Complexity and Structure. Lecture Notes in Computer Science #211. Springer-Verlag, 1986. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On Unique Satisfiability and Randomized Reductions - Chang, Rohatgi (Correct)
.... which they called d BP Delta in which the error probability is required to be very small: A 2 d BP DeltaC = 8p; 9B 2 C; Prob z [ x 2 A ( x; z) 2 B ] 1 Gamma 2 Gammap(n) We know that if the class C is closed under majority reductions, then all of the reductions above are equivalent [Sch86] However, for classes not known to be closed under majority reductions, it makes sense to consider d BP Delta operations separately. In their paper, Toda and Ogiwara showed that PH d BP DeltaK where K is any of the counting classes: PP, Phi P, C =P, or MOD g P. Moreover, they use a ....
U. Schoning. Complexity and Structure. Lecture Notes in Computer Science #211. Springer-Verlag, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC