✦ LIBER ✦

Computational complexity of winning strategies in two-person polynomial games

✍ Scribed by J. P. Jones

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexities of Winning Strategies in Di

✍ J.P. Jones; A.S. Fraenkel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB

On the Complexity of Computing Winning S

✍ Michael Soltys; Craig Wilson 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 480 KB

On the geometry of optimal strategies in

✍ Austin Blaquière; Françoise Gérard 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 558 KB

The learning of strategies in a simple,

✍ John Fox 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

Algorithms of polynomial complexity for

✍ E.N. Gordeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 481 KB