✦ LIBER ✦

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

✍ Scribed by Daniel Meister

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Membership Problems fo

✍ Pierre McKenzie; Klaus W. Wagner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 404 KB

Equivalence Problems for Circuits over S

✍ Christian Glaßer; Katrin Herr; Christian Reitwießner; Stephen Travers; Matthias 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 606 KB