Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

By Kousha Etessami, Mihalis Yannakakis. JACM, 2005

531 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/3939ab4498e35f8404fddbe42ae5bb1d4e62258f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Kousha Etessami
2. Mihalis Yannakakis
3. Chris Peikert

In Computational Theory and Mathematics

1. Kousha Etessami
2. Mihalis Yannakakis
3. Chris Peikert

Citations in the corpus

• On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) (2010, methodology): “This can be done in P-time ([19]), yielding a reduced system x = F (x) on the remaining variables.”