Idempotent and tropical mathematics; complexity of algorithms and interval analysis
type: Item
instance of: scholarly article
title: Idempotent and tropical mathematics; complexity of algorithms and interval analysis
zbMATH Open document ID: 1362.68110
publication date: 2016-07-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1209.1721
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 16Y60
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 65G40
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6601231
zbMATH Keywords: tropical mathematics
zbMATH Keywords: idempotent mathematics
zbMATH Keywords: complexity of algorithms
zbMATH Keywords: interval analysis
author: Grigori L. Litvinov
MaRDI profile type: Publication
OpenAlex ID: W2962952882
arXiv ID: 1209.1721
cites work: Q2995296
cites work: Idempotent mathematics: a correspondence principle and its applications to computing
cites work: Q4395236
cites work: Tropical algebraic geometry
cites work: Enumerative tropical algebraic geometry in ℝ²
cites work: Q5490930
cites work: Q4408031
cites work: Attractors for equations of mathematical physics
cites work: Idempotent Mathematics and Mathematical Physics
cites work: Q3804221
cites work: Q4700998
cites work: Q4337616
cites work: Linear functionals on idempotent spaces. An algebraic approach
cites work: Tensor products of idempotent semimodules. An algebraic approach
cites work: Idempotent functional analysis: An algebraic approach
cites work: Q4428791
cites work: Universal numerical algorithms and their software implementation
cites work: Q3517117
cites work: Tropical and Idempotent Mathematics
cites work: Nuclear semimodules and kernel theorems in idempotent analysis: an algebraic approach
cites work: Q5485851
cites work: Duality and separation theorems in idempotent semimodules.
cites work: On a new principle of superposition for optimization problems
cites work: Q3796271
cites work: An Algebra for Network Routing Problems
cites work: Q3903001
cites work: Q5286663
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models
cites work: Q5331549
cites work: Exact interval solutions of the discrete Bellman equation, and the polynomial complexity of problems in interval idempotent linear algebra.
cites work: Idempotent interval analysis and optimization problems
cites work: Q4304869
cites work: Q3964346
cites work: Q3960718
cites work: Algebraic structures for transitive closure
cites work: Q4344003
cites work: Max-linear Systems: Theory and Algorithms
cites work: A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
cites work: Complexity of tropical and MIN-plus linear prevarieties
cites work: Interval systems over idempotent semiring
cites work: On the frontiers of polynomial computations in tropical geometry
cites work: The complexity of tropical matrix factorization
cites work: Q3345690
cites work: Linear Optimization Problems with Inexact Data
cites work: Computational complexity and feasibility of data processing and interval computations
cites work: Q3207999
cites work: Derived eigenvalues of symmetric matrices, with applications to distance geometry
cites work: Interval arithmetic and linear algebra over idempotent semirings.
cites work: Interval systems of max-separable linear equations
cites work: Control solvability of interval systems of max-separable linear equations
cites work: Optimale Lösung von Intervallgleichungssystemen
cites work: Computing exact bounds on elements of an inverse interval matrix is NP-hard
DOI: 10.1016/J.CAMWA.2012.09.008
published in: Computers & Mathematics with Applications
description: scientific article