Verifying minimum stable circuit values

DOI10.1016/S0020-0190(02)00453-2zbMath1173.68532OpenAlexW1991555067MaRDI QIDQ1007566

Chung Keung Poon

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00453-2

zbMATH Keywords

verificationcomputational complexityarithmetic circuitstochastic game

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probabilistic games; gambling (91A60)

Related Items (1)

On strategy improvement algorithms for simple stochastic games

Cites Work

• The complexity of stochastic games
• A subexponential randomized algorithm for the simple stochastic game problem
• Alternation

This page was built for publication: Verifying minimum stable circuit values