Verifying minimum stable circuit values

Authors:
C. K. Poon
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong, People's Republic of China
Venue:
Information Processing Letters
Year:
2003

Citing 3
Cited 1

The complexity of stochastic games

Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem

Information and Computation
Alternation

Journal of the ACM (JACM)

On strategy improvement algorithms for simple stochastic games

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study properties of the minimum stable circuit value of a certain class of arithmetic circuits and describe a polynomial time algorithm that checks if a given circuit value is minimum stable for any such circuit.