EUR 6,10
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Como nuevo. : El libro 'Sciences Economiques & Sociales 1re ES' es un manual de estudio para estudiantes de primer año de secundaria, enfocado en las ciencias económicas y sociales. Publicado por Nathan en 2011, este libro de texto ofrece una visión completa del programa de estudios de 2011, con 407 páginas de contenido educativo. El libro está escrito en francés y es una herramienta esencial para los estudiantes que buscan comprender los principios fundamentales de la economía y las ciencias sociales. EAN: 9782091726144 Tipo: Libros Categoría: Educación|Libros de Texto Título: Sciences Economiques & Sociales 1re ES Autor: Claude-Danièle Échaudemaison| Monique Abellard| Serge Bosc| Renaud Chartoire| Delphine de Chouly| Collectif| Iris Drahy-Ranzieri| Brigitte Fouilland| Olivier Leblanc| Fabienne Lepage| Sophie Loiseau| Arnaud Parienty| Sarah Roux-Périnet| Robert Soin| Hélène Thammavongsa| Agnès Vallée Editorial: Nathan Idioma: fr Páginas: 407 Formato: tapa blanda.
Librería: Ammareal, Morangis, Francia
EUR 9,99
Cantidad disponible: 1 disponibles
Añadir al carritoSoftcover. Condición: Très bon. Edition 2004. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Edition 2004. Ammareal gives back up to 15% of this item's net price to charity organizations.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 192,28
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 241,00
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642261647 ISBN 13: 9783642261640
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 246,09
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational aspects of geometry of numbers have been revolutionized by the Lenstra Lenstra Lovasz lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN 03 and CAEN 05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2009
ISBN 10: 3642022944 ISBN 13: 9783642022944
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 246,09
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational aspects of geometry of numbers have been revolutionized by the Lenstra Lenstra Lovasz lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN 03 and CAEN 05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2012, 2012
ISBN 10: 3642261647 ISBN 13: 9783642261640
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 246,09
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -Computational aspects of geometry of numbers have been revolutionized by the LensträLensträLovasz ¿ lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle ¿ at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee ¿ with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN ¿03 and CAEN ¿05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee ¿ were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 512 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2009, 2009
ISBN 10: 3642022944 ISBN 13: 9783642022944
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 246,09
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware -Computational aspects of geometry of numbers have been revolutionized by the LensträLensträLovasz ¿ lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle ¿ at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee ¿ with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN ¿03 and CAEN ¿05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee ¿ were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 512 pp. Englisch.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 190,30
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2009
ISBN 10: 3642022944 ISBN 13: 9783642022944
Librería: moluna, Greven, Alemania
EUR 206,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first book to offer a comprehensive view of the LLL algorithm.The History of the LLL-Algorithm.- Hermite#x2019s Constant and Lattice Algorithms.- Probabilistic Analyses of Lattice Reduction Algorithms.- Progress on LLL and Lattice Reduct.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642261647 ISBN 13: 9783642261640
Librería: moluna, Greven, Alemania
EUR 206,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first book to offer a comprehensive view of the LLL algorithm.The History of the LLL-Algorithm.- Hermite#x2019s Constant and Lattice Algorithms.- Probabilistic Analyses of Lattice Reduction Algorithms.- Progress on LLL and Lattice Reduct.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Mrz 2012, 2012
ISBN 10: 3642261647 ISBN 13: 9783642261640
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 246,09
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational aspects of geometry of numbers have been revolutionized by the Lenstra Lenstra Lovasz lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN 03 and CAEN 05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed. 512 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Nov 2009, 2009
ISBN 10: 3642022944 ISBN 13: 9783642022944
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 246,09
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational aspects of geometry of numbers have been revolutionized by the Lenstra Lenstra Lovasz lattice reduction algorithm (LLL), which has led to bre- throughs in elds as diverse as computer algebra, cryptology, and algorithmic number theory. After its publication in 1982, LLL was immediately recognized as one of the most important algorithmic achievements of the twentieth century, because of its broad applicability and apparent simplicity. Its popularity has kept growing since, as testi ed by the hundreds of citations of the original article, and the ever more frequent use of LLL as a synonym to lattice reduction. As an unfortunate consequence of the pervasiveness of the LLL algorithm, researchers studying and applying it belong to diverse scienti c communities, and seldom meet. While discussing that particular issue with Damien Stehle at the 7th Algorithmic Number Theory Symposium (ANTS VII) held in Berlin in July 2006, John Cremona accuratelyremarkedthat 2007would be the 25th anniversaryof LLL and this deserveda meetingto celebrate that event. The year 2007was also involved in another arithmetical story. In 2003 and 2005, Ali Akhavi, Fabien Laguillaumie, and Brigitte Vallee with other colleagues organized two workshops on cryptology and algorithms with a strong emphasis on lattice reduction: CAEN 03 and CAEN 05, CAEN denoting both the location and the content (Cryptologie et Algori- miqueEn Normandie). Veryquicklyafterthe ANTSconference,AliAkhavi,Fabien Laguillaumie, and Brigitte Vallee were thus readily contacted and reacted very enthusiastically about organizing the LLL birthday conference. The organization committee was formed. 512 pp. Englisch.
Librería: preigu, Osnabrück, Alemania
EUR 213,95
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. The LLL Algorithm | Survey and Applications | Phong Q. Nguyen (u. a.) | Taschenbuch | xiv | Englisch | 2012 | Springer | EAN 9783642261640 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.