Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture (Q2941485)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture |
scientific article |
Statements
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (English)
0 references
21 August 2015
0 references
dynamic graph algorithms
0 references
lower bounds
0 references
0 references
0.8629065155982971
0 references
0.8451429605484009
0 references
0.8230385184288025
0 references
0.7791053652763367
0 references
0.77522873878479
0 references
