✦ LIBER ✦

Computational completeness of equations over sets of natural numbers

✍ Scribed by Jeż, Artur; Okhotin, Alexander

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Equations over Sets of Nat

✍ Artur Jeż; Alexander Okhotin 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 559 KB

On the expressive power of univariate eq

✍ Alexander Okhotin; Panos Rondogiannis 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Equivalence Problems for Circuits over S

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

The Complexity of Membership Problems fo

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

Computable Solutions of Equations over E

✍ E. F. Combarro 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 230 KB

Polynomial-Space Decidable Membership Pr

✍ Daniel Meister 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 388 KB