Sciweavers

SAGA
2007
Springer

On Computation and Communication with Small Bias

14 years 5 months ago
On Computation and Communication with Small Bias
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication complexity. The class PP in fact has two, a version with weakly restricted bias called PPcc , and a version with unrestricted bias called UPPcc
Harry Buhrman
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where SAGA
Authors Harry Buhrman
Comments (0)