✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 510 || An almost linear-time algorithm for the dense subset-sum problem

✍ Scribed by Albert, Javier Leach; Monien, Burkhard; Artalejo, Mario Rodríguez

Book ID: 126975728
Publisher: Springer Berlin Heidelberg
Year: 1991
Weight: 708 KB
Category: Article
ISBN: 3540475168
DOI: 10.1007/3-540-54233-7_177

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 510 || Model-checking for probabilistic real-time systems

✍ Albert, Javier Leach; Monien, Burkhard; Artalejo, Mario Rodríguez 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 949 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithmic Number Theory Volume 5011 || An Improved Multi-set Algorithm for the Dense Subset Sum Problem

✍ van der Poorten, Alfred J.; Stein, Andreas 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 445 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 510 || A confluent reduction for the λ-calculus with surjective pairing and terminal object

✍ Albert, Javier Leach; Monien, Burkhard; Artalejo, Mario Rodríguez 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 894 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 85 || The complexity of the inequivalence problem for regular expressions with intersection

✍ Bakker, Jaco; Leeuwen, Jan 📂 Article 📅 1980 🏛 Springer Berlin Heidelberg ⚖ 681 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2007 Volume 4708 || A Linear Time Algorithm for the k Maximal Sums Problem

✍ Kučera, Luděk; Kučera, Antonín 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 536 KB

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks add

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 1256 || The word matching problem is undecidable for finite special string-rewriting systems that are confluent

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