QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(log n)ω(1) colors where n is the number of vertices. Previously, Guruswami Harsha, Håstad, Srinivasan, and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with {equation presented} colors. Their result is obtained by composing a standard outer probabilistically checkable proof (PCP) with an inner PCP based on the short code of superconstant degree. Our result is instead obtained by composing a new outer PCP with an inner PCP based on the short code of degree two.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Robert C. Durbeck
IEEE TACON
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997