Finding a matrix of rank n to the o(1/log log n) in a subspace of n by n matrices over F_{2^r} promised to contain a rank-1 matrix is hard, assuming NP has no subexponential algorithms.
and Johnson, David S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
citing papers explorer
-
Strong Inapproximability for a Promise Rank Problem
Finding a matrix of rank n to the o(1/log log n) in a subspace of n by n matrices over F_{2^r} promised to contain a rank-1 matrix is hard, assuming NP has no subexponential algorithms.
- Tokenization with Split Trees