Before revision:  In this paper, we show that for every m \in \mathbb{N there exists a constant \sigma_m >0 such that an instance of Bin Packing with m bins can be solved in O(2^{(1-\sigma_m)n}) randomized time.
After revision:  In this paper, we show that for every m \in \mathbf{N there exists a constant \sigma_m >0 such that an instance of Bin Packing with m bins can be solved in O(2^{(1-\sigma_m)n}) randomized time.