✦ LIBER ✦

Undecidable Problems for Probabilistic Automata of Fixed Dimension

✍ Scribed by Blondel; Canterini

Publisher: Springer
Year: 2003
Tongue: English
Weight: 120 KB
Volume: 36
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-003-1061-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the undecidability of probabilistic p

On the undecidability of probabilistic planning and related stochastic optimization problems

✍ Omid Madani; Steve Hanks; Anne Condon 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 281 KB

The problem of completeness in the struc

The problem of completeness in the structural theory of probabilistic automata

✍ L. V. Makarevich 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 419 KB

Application of growing probabilistic aut

Application of growing probabilistic automata for mathematical modeling

✍ L. V. Matsevityi 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 413 KB

On Linear-Time Deterministic Algorithms

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

✍ Bernard Chazelle; Jiřı́ Matoušek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O Ž d . , which is better than those for previously known algori

Complexity of the word problem for commu

Complexity of the word problem for commutative semigroups of fixed dimension

✍ Dung T. Huynh 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

Probabilistic Methods for Decomposition

Probabilistic Methods for Decomposition Dimension of Graphs

✍ Mariko Hagita; André Kündgen; Douglas B. West 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 305 KB