2000 character limit reached
Universal algorithms for solving the matrix Bellman equations over semirings
Published 22 Sep 2012 in math.RA | (1209.5011v3)
Abstract: This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software implementations are discussed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.