The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet