This paper presents three efficient subband adaptive filter (SAF) algorithms featuring low computational complexity. In the first algorithm, which is called selective partial update SAF (SPU-SAF), the filter coefficients are partially updated in each subband rather than the entire filter at every adaptation. In the second one, the concept of set-membership (SM) adaptive filtering is extended to the SAFs and a novel SM-SAF algorithm is presented. This algorithm exhibits superior performance with significant reduction in the overall computational complexity compared with the ordinary SAF. The third algorithm is based on the combination of the ideas in the SPU-SAF and SM-SAF algorithms. We demonstrate the usefulness of the proposed algorithms through simulations.