scientific article; zbMATH DE number 4156195
From MaRDI portal
Publication:3484622
zbMATH Open0704.90060MaRDI QIDQ3484622FDOQ3484622
Authors: A. O. Alekseev, O. G. Alekseev, V. G. Anisimov, E. G. Anisimov, N. I. Yachkula
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
- Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
- scientific article; zbMATH DE number 1908189
- Computational Performance Bounds for Markov Chains With Applications
- scientific article; zbMATH DE number 653033
- Revised simplex algorithm for finite Markov decision processes
- The Complexity of Markov Decision Processes
- Complexity and approximability of the marking problem
- The complexity of the simplex method
- The simplex method is strongly polynomial for deterministic Markov decision processes
Numerical mathematical programming methods (65K05) Linear programming (90C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484622)