✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 700 || Polynomially bounded minimization problems which are hard to approximate

✍ Scribed by Lingas, Andrzej; Karlsson, Rolf; Carlsson, Svante

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

✍ Kuich, W. 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 1002 KB

[Lecture Notes in Computer Science] Auto

✍ Abramsky, Samson; Gavoille, Cyril; Kirchner, Claude; Meyer auf der Heide, Friedh 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 213 KB

[Lecture Notes in Computer Science] Auto

✍ Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 240 KB

[Lecture Notes in Computer Science] Auto

✍ Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 732 KB