Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
We show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant. © 1994.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990