Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.
Cryptology ePrint Archive, Paper 2018/244, URL https://eprint.iacr.org/2018/244 Heinrich K, Hell P (1987) On the problems of bandsize
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
citing papers explorer
-
Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication
Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.