Login / Signup
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.
Matthias Bentert
Klaus Heeger
Tomohiro Koana
Published in:
ESA (2023)
Keyphrases
</>
matrix multiplication
computational complexity
special case
learning algorithm
worst case
similarity measure
data structure
higher order
optimization problems