• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Matthias BentertKlaus HeegerTomohiro Koana
Published in: ESA (2023)
Keyphrases
  • matrix multiplication
  • computational complexity
  • special case
  • learning algorithm
  • worst case
  • similarity measure
  • data structure
  • higher order
  • optimization problems