Idempotent and tropical mathematics; complexity of algorithms and interval analysis

DOI10.1016/j.camwa.2012.09.008zbMath1362.68110arXiv1209.1721OpenAlexW2962952882MaRDI QIDQ2629456

Grigori L. Litvinov

Publication date: 6 July 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.1721

zbMATH Keywords

interval analysisidempotent mathematicstropical mathematicscomplexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General methods in interval analysis (65G40) Semirings (16Y60) Numerical linear algebra (65F99)

Related Items (2)

Editorial: Grasping complexity ⋮ Subtraction-free complexity, cluster transformations, and spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nuclear semimodules and kernel theorems in idempotent analysis: an algebraic approach
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Interval systems over idempotent semiring
• Algebraic structures for transitive closure
• Computational complexity and feasibility of data processing and interval computations
• Duality and separation theorems in idempotent semimodules.
• Interval arithmetic and linear algebra over idempotent semirings.
• Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra.
• Tensor products of idempotent semimodules. An algebraic approach
• Universal numerical algorithms and their software implementation
• Linear functionals on idempotent spaces. An algebraic approach
• Computing exact bounds on elements of an inverse interval matrix is NP-hard
• Optimale Lösung von Intervallgleichungssystemen
• Complexity of tropical and MIN-plus linear prevarieties
• Dioïds and semirings: Links to fuzzy sets and other applications
• The complexity of tropical matrix factorization
• On the frontiers of polynomial computations in tropical geometry
• A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
• Control solvability of interval systems of max-separable linear equations
• Tropical and Idempotent Mathematics
• On a new principle of superposition for optimization problems
• Max-linear Systems: Theory and Algorithms
• Idempotent mathematics: a correspondence principle and its applications to computing
• Enumerative tropical algebraic geometry in ℝ²
• Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models
• Idempotent Mathematics and Mathematical Physics
• Linear Optimization Problems with Inexact Data
• An Algebra for Network Routing Problems
• Tropical algebraic geometry
• Idempotent interval analysis and optimization problems
• Interval systems of max-separable linear equations
• Idempotent functional analysis: An algebraic approach
• Interval systems of max-separable linear equations

This page was built for publication: Idempotent and tropical mathematics; complexity of algorithms and interval analysis