Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
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.
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Oliver Bodemer
IBM J. Res. Dev
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009