✦ LIBER ✦

The isomorphism problem for k-trees is complete for logspace

✍ Scribed by V. Arvind; Bireswar Das; Johannes Köbler; Sebastian Kuhnert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Isomorphism Problem for Planar 3-Con

✍ Thomas Thierauf; Fabian Wagner 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 567 KB

The binary network flow problem is logsp

✍ Thomas Lengauer; Klaus W. Wagner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 704 KB

The isomorphism problem for ω-automatic

✍ Dietrich Kuske; Jiamou Liu; Markus Lohrey 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Isomorphism testing of k-trees is in NC,

✍ N. Chandrasekharan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

On the subtree isomorphism problem for o

✍ Erkki Mäkinen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Some comments on the subtree isomorphism

✍ Pratul Dublish 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 210 KB