Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.

Matthias Bentert Klaus Heeger Tomohiro Koana

Published in: CoRR (2024)

Keyphrases

matrix multiplication
computational complexity
learning algorithm
worst case
special case
three dimensional
software engineering
message passing
high quality
lower bound
optimization problems
stereo matching
approximation algorithms
highly efficient
distributed memory