๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by van der Poorten, Alfred J.; Stein, Andreas


Book ID
118247551
Publisher
Springer Berlin Heidelberg
Year
2008
Weight
445 KB
Category
Article
ISBN
3540794565

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Grap
โœ Hromkoviฤ, Juraj; Nagl, Manfred; Westfechtel, Bernhard ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V

[Lecture Notes in Computer Science] Algo
โœ Hess, Florian; Pauli, Sebastian; Pohst, Michael ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 473 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Algorithmic Number Theory Symposium, Ants 2006, Held In Berlin, July 2006. The Book Presents 37 Revised Full Papers Together With 4 Invited Papers Selected For Inclusion. The Papers Are Organized In Topical Sections On Algebraic

[Lecture Notes in Computer Science] Math
โœ 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