Visu Makam

Orcid: 0000-0001-8470-7860

According to our database1, Visu Makam authored at least 17 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Generic Reed-Solomon Codes Achieve List-Decoding Capacity.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

The minimal canonical form of a tensor network.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes.
IEEE Trans. Inf. Theory, 2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations.
SIAM J. Appl. Algebra Geom., 2021

Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes.
CoRR, 2021

Polynomial Time Algorithms in Invariant Theory for Torus Actions.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties).
Electron. Colloquium Comput. Complex., 2019

Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings.
Electron. Colloquium Comput. Complex., 2019

An exponential lower bound for the degrees of invariants of cubic forms and tensor actions.
CoRR, 2019

More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Algorithms for orbit closure separation for invariants and semi-invariants of matrices.
CoRR, 2018

On the tensor rank of 3s×3 permanent and determinant.
CoRR, 2018

2015
Polynomial degree bounds for matrix semi-invariants.
CoRR, 2015


  Loading...