We continue the study of:complexity classes over the weak model introd
uced by P. Koiran. In particular we provide several separations of com
plexity classes, the most remarkable being the strict inclusion of P i
n NP. Other separations concern classes defined by weak polynomial tim
e over parallel or alternating machines as well as over nondeterminist
ic machines whose guesses are required to be 0 or 1.