Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases

Gasieniec, L; Jansson, J; Levcopoulos, C; Lingas, A; Persson, M

Lingas, A (corresponding author), Lund Univ, Dept Comp Sci, S-22100 Lund, Sweden.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 118 (): 108

Abstract

Henzinger et al. posed the so-called Online Boolean Matrix-vector Multiplication (OMv) conjecture and showed that it implies tight hardness results fo......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索