✦ LIBER ✦

Complexity of Nilpotent Unification and Matching Problems

✍ Scribed by Qing Guo; Paliath Narendran; D.A. Wolfram

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching, unification and complexity

✍ Kapur, Deepak; Narendran, Paliath 📂 Article 📅 1987 🏛 Association for Computing Machinery ⚖ 250 KB

Computational Complexity of Simultaneous

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 191 KB

The Complexity of Linear and Stratified

✍ Manfred Schmidt-Schauß; Jürgen Stuber 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 253 KB

The Complexity of Counting Problems in E

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 KB

The undecidability of the unification an

✍ Stephan Heilbrunner; Steffen Hölldobler 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 662 KB

The complexity of the equivalence and eq

✍ Gábor Horváth 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 285 KB