LIBRISTO
LIBROAMANTO
mandatory
Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free
0
Free delivery for purchases over 69.99 €
DPD courier 5.99 Bpost point 7.99 Bpost 7.49 DPD point 3.49 GLS courier 4.49

Free delivery for orders over 69.99 euro.

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra

Language EnglishEnglish
Book Paperback
Book Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra Veronika Pillwein
Libristo code: 37225246
Publishers Springer Nature Switzerland AG, September 2021
The book is centered around the research areas of combinatorics, special functions, and computer alg... Full description
? points 249 b
103.10
In stock at our supplier Shipping in 5-8 days

30-day return policy


Customers also purchased


Zur Neuesten Literatur Uber Kapital Und Kapitalzins (1907) Eugen Von Bohm-Bawerk / Book Paperback
common.buy 20.35
Aksiologiya, epistemika i deontika tekstov serii Dyuna F.Gerberta Nikitina Tat'yana Germanovna / Book Paperback
common.buy 53.47
Lacan Berriau / Book Paperback
common.buy 18.93
Veggie for Family - Erweiterte Neuausgabe 2024 Inga Pfannebecker / Book Hardback
common.buy 26.02

The book is centered around the research areas of combinatorics, special functions, and computer algebra. What these research fields share is that many of their outstanding results do not only have applications in Mathematics, but also other disciplines, such as computer science, physics, chemistry, etc. A particular charm of these areas is how they interact and influence one another. For instance, combinatorial or special functions' techniques have motivated the development of new symbolic algorithms. In particular, first proofs of challenging problems in combinatorics and special functions were derived by making essential use of computer algebra. This book addresses these interdisciplinary aspects. Algorithmic aspects are emphasized and the corresponding software packages for concrete problem solving are introduced. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.

Actress & Polyglot
EWA KASP for
Play video
Ewa Kasp
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.

About the book

Full name Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra
Language English
Binding Book - Paperback
Date of issue 2021
Number of pages 410
EAN 9783030445614
ISBN 3030445615
Libristo code 37225246
Weight 652
Dimensions 155 x 235 x 24
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's address

You might also be interested in


Graph-Theoretic Concepts in Computer Science Pawel Rzazewski / Book Paperback
common.buy 87.70
Algebra, Logic And Combinatorics Tom Fearn / Book Paperback
common.buy 41.01
Combinatorics and Graph Theory John M. Harris / Book Hardback
common.buy 55.80
Dirty Dancing: The Official Coloring Book Paula Rozelle Hanback / Book Paperback
common.buy 15.39
Modern Software Engineering Ryan McNeil / Book Hardback
common.buy 120.92
C++ Programming Emily Jones / Book Hardback
common.buy 132.06
The Buddha of Suburbia Hanif Kureishi / Book Paperback
common.buy 14.27
What Is Meditation? Rob Nairn / Book Paperback
common.buy 16.30
Shake Hands With The Devil Romeo Dallaire / Book Paperback
common.buy 13.97
Extremal Combinatorics Stasys Jukna / Book Hardback
common.buy 100.87
Parsing Techniques Dick Grune / Book Paperback
common.buy 226.56

Login

Log in to your account. Don't have a Libristo account? Create one now!

 
mandatory
mandatory

Don’t have an account? Discover the benefits of having a Libristo account!

With a Libristo account, you'll have everything under control.

Create a Libristo account
Book advisor Libroamiko
Hi, I'm Libroamiko, can I help?