✦ LIBER ✦

Mailbox¶The decidability of the affine completeness generation problem

✍ Scribed by Kalle Kaarli; Alden Pixley

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the classification of bases inPkaccor

✍ D. N. Babin 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 187 KB

Decidability of the termination problem

✍ Alain Finkel 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 854 KB

Complete affine hypersurfaces. Part I. T

✍ Shiu-Yuen Cheng; Shing-Tung Yau 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 922 KB

The decidability of the DOL-DTOL equival

✍ Keijo Ruohonen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 660 KB

On the decidability of the word problem

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

Decidable, polynomial-time, and np-compl

✍ V. G. Timkovskii; L. V. Knyazeva 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 844 KB