Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
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.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking