Rolf Clauberg
IBM J. Res. Dev
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.
Rolf Clauberg
IBM J. Res. Dev
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011