Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
1
0
0
3
The first superconstant-factor NP-hardness of approximation result for homogeneous MinRank under randomized polynomial-time reductions is proved, achieving a logarithmic gap even when the rank-one witness has a Boolean right factor.