Yao (in a lecture at DIMACS Workshop on structural complexity and
cryptography) showed that if a language L is 2-locally-random
reducible to a Boolean functio, then L is in PSPACE/poly.
Fortnow and Szegedy quantitatively improved Yao's result to show that
such languages are in fact in NP/poly (Information Processing Letters, 1992).

In this paper we extend Yao's result to show that if a language L
is 2-locally-random reducible to a target function which takes values
in {0,1,2}, then L is in PSPACE/poly.