Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
We continue the study of complexity classes over the weak model introduced by P. Koiran. In particular we provide several separations of complexity classes, the most remarkable being the strict inclusion of P in NP. Other separations concern classes defined by weak polynomial time over parallel or alternating machines as well as over nondeterministic machines whose guesses are required to be 0 or 1. © 1994.
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Pradip Bose
VTS 1998
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Bowen Zhou, Bing Xiang, et al.
SSST 2008