Conference paper
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004
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.
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007