# Complexity class for probabilistic approximation algorithms with bounded error

What's the name of a complexity class of optimization problems that have "bounded error probabilistic approximation algorithms"? Bounded error probabilistic version of APX (as BPP is bounded error probabilistic version of P), or approximation version of BPP (as APX is approximation version of P).

• This question was reposted and answered on cstheory.se: cstheory.stackexchange.com/questions/20599/… – mdxn Aug 29 '14 at 0:15
• The title reminds PAC = "probably approximately correct" which Josh mentioned in his comment on cstheory. – Kaveh Sep 11 '14 at 18:27