  We discuss numerical complexity of the L\"uscher algorithm applied to the
Hubbard Model. In particular we present comparison to a certain algorithm based
on direct computation of the fermionic determinant.
