On the computational complexity of assumption-based argumentation for default reasoning