Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 134,77
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 147,33
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 166,01
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 180,53
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.
Idioma: Inglés
Publicado por Springer Nature Switzerland, Springer International Publishing, 2020
ISBN 10: 3030670791 ISBN 13: 9783030670795
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 149,79
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book uses new mathematical tools to examine broad computability and complexity questions inenumerative combinatorics, with applications to other areas of mathematics, theoretical computer science,and physics. A focus on effective algorithms leads to the development of computer algebra software of use toresearchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the textshows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables(ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory,applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, throughexamples and general theory, how results from stratified Morse theorycan help refine some of thesecomputability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 225,21
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. New. book.
Idioma: Inglés
Publicado por Springer Nature Switzerland Dez 2020, 2020
ISBN 10: 3030670791 ISBN 13: 9783030670795
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 149,79
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book uses new mathematical tools to examine broad computability and complexity questions inenumerative combinatorics, with applications to other areas of mathematics, theoretical computer science,and physics. A focus on effective algorithms leads to the development of computer algebra software of use toresearchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the textshows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables(ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory,applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, throughexamples and general theory, how results from stratified Morse theorycan help refine some of thesecomputability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text. 440 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 183,18
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 187,10
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Springer Nature Switzerland, Springer International Publishing Dez 2020, 2020
ISBN 10: 3030670791 ISBN 13: 9783030670795
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 149,79
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theorycan help refine some of these computability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 440 pp. Englisch.
Publicado por Springer International Publishing, 2020
ISBN 10: 3030670791 ISBN 13: 9783030670795
Librería: moluna, Greven, Alemania
EUR 127,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. Interactive computer algebra worksheets allow deeper understanding of the materialMany fully worked detailed examples help to illustrate advanced theoretical methodsUnique blend of theory, computation, and applications .