The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Pan, Victor Y. / rank
Normal rank
 
Property / author
 
Property / author: Pan, Victor Y. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(81)90130-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139007071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Fast Algorithms for Matrix Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New combinations of methods for the acceleration of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bit-complexity of arithmetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / 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: New Bounds on the Complexity of the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures for matrix multiplication algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Continued Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path problem is not harder than matrix multiplication / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:27, 13 June 2024

scientific article
Language Label Description Also known as
English
The bit-operation complexity of matrix multiplication and of all pair shortest path problem
scientific article

    Statements

    Identifiers

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