Thomas M. Cheng
IT Professional
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.
Thomas M. Cheng
IT Professional
David A. Selby
IBM J. Res. Dev
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975