Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2600893748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces, convolutions, and \(X+Y\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Verification of Integer Matrix Multiplication in Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone switching circuits and Boolean matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Negative Thinking in Multiplying Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path problem is not harder than matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of additions in monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank

Latest revision as of 20:09, 13 July 2024

scientific article
Language Label Description Also known as
English
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model
scientific article

    Statements

    Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    semi-disjoint bilinear form
    0 references
    semiring
    0 references
    vector convolution
    0 references
    matrix multiplication
    0 references
    distance product
    0 references
    circuit complexity
    0 references
    unit-cost ram
    0 references
    time complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references