2 papers
cs.OH2003
On probabilistic analog automata
A. Ben-Hur, A. Roitershtein, H. Siegelmann
We consider probabilistic automata on a general state space and study their computational power. The model is based on the concept of language recognition by probabilistic automata…
cs.CC2001
Probabilistic analysis of a differential equation for linear programming
Asa Ben-Hur, Joshua Feinberg, Shmuel Fishman +1
In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solut…