3D rectangulations and geometric matrix multiplication (Q1702124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular partition is polynomial in two dimensions but NP-complete in three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945512 / 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: Q4427871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a manhattan path and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank

Latest revision as of 06:29, 15 July 2024

scientific article
Language Label Description Also known as
English
3D rectangulations and geometric matrix multiplication
scientific article

    Statements

    3D rectangulations and geometric matrix multiplication (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    decomposition problem
    0 references
    minimum rectangulation
    0 references
    orthogonal polyhedron
    0 references
    matrix multiplication
    0 references
    time complexity
    0 references
    0 references