We prove that polynomial-time tissue P systems with cell division or cell separation can be simulated efficiently by Turing machines with oracles for counting problems. This shows that the corresponding complexity classes are included in ^#, thus improving, under standard complexity theory assumptions, the previously known upper bound .
