3D rectangulations and geometric matrix multiplication
DOI10.1007/S00453-016-0247-3zbMATH Open1386.68195OpenAlexW2614723287MaRDI QIDQ1702124FDOQ1702124
Authors: Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu 
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0247-3
Recommendations
- 3D rectangulations and geometric matrix multiplication
- Partitioning orthogonal histograms into rectangular boxes
- Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms
- Rectangular partition is polynomial in two dimensions but NP-complete in three
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms
matrix multiplicationtime complexitydecomposition problemorthogonal polyhedronminimum rectangulation
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Powers of tensors and fast matrix multiplication
- Computational geometry. Algorithms and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- Finding a manhattan path and related problems
- Rectangular partition is polynomial in two dimensions but NP-complete in three
- Regularity lemmas and combinatorial algorithms
- Title not available (Why is that?)
- An improved bound on Boolean matrix multiplication for highly clustered data.
Cited In (7)
- Geometric aspects of iterated matrix multiplication
- Title not available (Why is that?)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
- 3D rectangulations and geometric matrix multiplication
- Algebraic structures determined by 3 by 3 matrix geometry
- Partitioning orthogonal histograms into rectangular boxes
- Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms
This page was built for publication: 3D rectangulations and geometric matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702124)
