We provide further results and a better description
of those in our earlier paper in TR96-055
We present the first worst-case hardness conditions
on the circuit complexity of EXP functions which are
sufficient to obtain P=BPP. In particular, we show that
from such hardness conditions it is possible to construct
quick Hitting Sets Generators with logarithmic prize.
As recently proved, i such generators
can efficiently derandomize any BPP-algorithm.
We provide further results and a better description
of those in our earlier paper in TR96-055
