The Research of the Polynomial Bounded Circuit-Size Complexity of Some Languages Approximate to Probabilistic Classes BPP and PP
Yarui Li · Computer Engineering and Science · 2009
The polynomially bounded circuit-size complexity of some languages which is approximate to the probabilistic classes BPP and PP are discussed with the concepts of bounded polynomial query output and bounded polynomial error output on some set.