... l-L^)^ C Le&fP(L2\L2)X f°r every sparse oracle X. In [Ve93] a polylogtime Turing reducibility <^ is defined in a natural way. and it is shown that {L\, L'1)<^t ...
確定! 回上一頁