Login / Signup
Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors.
Shmuel Friedland
Stéphane Gaubert
Published in:
CoRR (2023)
Keyphrases
</>
worst case
high order
special case
computational complexity
np hardness
application specific
differential geometry
least squares
programming language
linear programming
hyperspectral images