Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113871641 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2020.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3118551000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cell probe bounds for succinct Boolean matrix-vector multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3D rectangulations and geometric matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Online Matrix-Vector Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Path, Matrix, and Triangle Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934692 / rank
 
Normal rank

Latest revision as of 18:41, 24 July 2024

scientific article
Language Label Description Also known as
English
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
scientific article

    Statements

    Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean matrix
    0 references
    product of matrix and vector
    0 references
    dynamic graph problems
    0 references
    online computation
    0 references
    time complexity
    0 references
    0 references
    0 references