✦ LIBER ✦

Probabilistic weak simulation is decidable in polynomial time

✍ Scribed by Christel Baier; Holger Hermanns; Joost-Pieter Katoen

Book ID: 108153336
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 232 KB
Volume: 89
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2003.10.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The logic-termal equivalence is polynomi

The logic-termal equivalence is polynomial-time decidable

✍ V.K. Sabelfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Tree equivalence of linear recursive sch

Tree equivalence of linear recursive schemata is polynomial-time decidable

✍ V.K. Sabelfeld 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 856 KB

Equivalence of free boolean graphs can b

Equivalence of free boolean graphs can be decided probabilistically in polynomial time

✍ Manuel Blum; Ashok K. Chandra; Mark N. Wegman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Probabilistic polynomial time is closed

Probabilistic polynomial time is closed under parity reductions

✍ Richard Beigel; Lane A. Hemachandra; Gerd Wechsung 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Equivalence of linear, free, liberal, st

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

✍ Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd; Michael R. Laurence 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Deciding k-colorability in expected poly

Deciding k-colorability in expected polynomial time

✍ Michael Krivelevich 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 79 KB

For every fixed k 3 we describe an algorithm for deciding k-colorability, whose expected running time in polynomial in the probability space G(n, p) of random graphs as long as the edge probability p = p(n) satisfies p(n) C/n, with C = C(k) being a sufficiently large constant.