Upper and lower bounds for Grigoriev's algorithm for solving integral tropical linear systems

DOI10.1007/s10958-013-1395-5zbMath1277.68086OpenAlexW1994944890MaRDI QIDQ376127

A. P. Davydow

Publication date: 4 November 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-013-1395-5

zbMATH Keywords

upper boundslower boundstime complexityGrigoriev's algorithmintegral tropical linear systems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Max-plus and related algebras (15A80)

Related Items (3)

Towards an operad-based cryptography: applications of commutative operads ⋮ An algorithm for solving an overdetermined tropical linear system using the analysis of stable solutions of subsystems ⋮ New algorithms for solving tropical linear systems

Cites Work

• A condition for the strong regularity of matrices in the minimax algebra
• Complexity of solving tropical linear systems
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Tropical Cryptography

This page was built for publication: Upper and lower bounds for Grigoriev's algorithm for solving integral tropical linear systems