A family of Boolean circuits \{C_n\}_{n\geq 0} is called \emph{\gamma(n)-weakly uniform} if
there is a polynomial-time algorithm for deciding the direct-connection language of every C_n,
given \emph{advice} of size \gamma(n). This is a relaxation of the usual notion of uniformity, which allows one
to interpolate between complete uniformity (when \gamma(n)=0) ... more >>>