( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The minimal canonical form of a tensor network.

, , , , , , и . FOCS, стр. 328-362. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Poonsaeng Visudhiphan

Mulopo Apollinaire Makambu

Kepher Makambi

 

Другие публикации лиц с тем же именем

The minimal canonical form of a tensor network., , , , , , и . FOCS, стр. 328-362. IEEE, (2023)Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes., , и . CoRR, (2021)Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes., , и . IEEE Trans. Inf. Theory, 68 (11): 7125-7140 (2022)On the tensor rank of 3s×3 permanent and determinant., и . CoRR, (2018)The minimal canonical form of a tensor network., , , , , , и . CoRR, (2022)Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture., , , , и . CCC, том 300 из LIPIcs, стр. 14:1-14:48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Algorithms for orbit closure separation for invariants and semi-invariants of matrices., и . CoRR, (2018)More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer., , , и . FOCS, стр. 824-844. IEEE Computer Society, (2019)Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties., и . FOCS, стр. 881-888. IEEE, (2020)Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings., , , , , и . CCC, том 169 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)