Journal ArticleOPEN ACCESS

A subexponential randomized algorithm for the simple stochastic game problem

Information and Computation (1995) 117(1) 151-155
DOI: 10.1006/inco.1995.1035
72Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe a randomized algorithm for the simple stochastic game problem that requires 2O(√n) expected operations for games with n vertices. This is the first subexponential time algorithm for this problem. © 1995 Academic Press, Inc.

Cite

CITATION STYLE

APA

Ludwig, W. (1995). A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation, 117(1), 151–155. https://doi.org/10.1006/inco.1995.1035

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free