[Other] An Efficient Uniqueness Theorem for Overcomplete Tensor Decomposition

tetett Post time Yesterday 06:12 | Show all posts |Read mode
This post will be closed automatically in 2026-09-17 06:11
Reward31points

journal:Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Authors:Pascal Koiran

Published date:2025-1-

DOI:10.1137/1.9781611978322.60

PDF link:https://epubs.siam.org/doi/pdf/10.1137/1.9781611978322.60

Article link:https://doi.org/10.1137/1.9781611978322.60

Article Source:Society for Industrial and Applied Mathematics


Remark:
Reply

Use magic Donate Report

All Reply0 Show all posts

Reply

You have to log in before you can reply Login | Register

Points Rules

Senior Member
  • post

  • reply

  • points

    1627


Return to the list