Login / Signup

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions.

Arvind V. MahankaliDavid P. WoodruffZiyu Zhang
Published in: ITCS (2024)
Keyphrases
  • fixed parameter tractable
  • worst case
  • learning algorithm
  • computational problems
  • np hard
  • combinatorial optimization problems
  • parameterized complexity